all InfoSec news
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs
March 11, 2024, 7:12 a.m. |
IACR News www.iacr.org
ePrint Report: New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs
Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky
Evolving secret-sharing schemes, defined by Komargodski, Naor, and Yogev [TCC 2016B, IEEE Trans. on Info. Theory 2018], are secret-sharing schemes in which there is no a-priory bound on the number of parties. In such schemes, parties arrive one by one; when a party arrives, the dealer gives it a share and cannot update this share in …
amos ben defined eprint report ieee info report secret sharing tcc theory
More from www.iacr.org / IACR News
Compact Key Storage: A Modern Approach to Key Backup and Delegation
1 day, 18 hours ago |
www.iacr.org
Quantum Evolving Secret Sharing for General Access Structures
1 day, 18 hours ago |
www.iacr.org
Preliminary Analysis of Ascon-Xof and Ascon-Hash
1 day, 18 hours ago |
www.iacr.org
PhD Student in Cryptography
1 day, 22 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Senior Security Researcher - Linux MacOS EDR (Cortex)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Sr. Manager, NetSec GTM Programs
@ Palo Alto Networks | Santa Clara, CA, United States
SOC Analyst I
@ Fortress Security Risk Management | Cleveland, OH, United States