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
Information-theoretic security with asymmetries
1 day, 10 hours ago |
www.iacr.org
Cryptanalytic Audit of the XHash Sponge Function and its Components
1 day, 10 hours ago |
www.iacr.org
Ipotane: Achieving the Best of All Worlds in Asynchronous BFT
1 day, 10 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Emergency Management Invoice Compliance Reviewer
@ AC Disaster Consulting | Denver, Colorado, United States - Remote
Threat Intelligence Librarian
@ Microsoft | Cheltenham, Gloucestershire, United Kingdom
Cyber Content Operations Manager - Remote in UK
@ Immersive Labs | United Kingdom
(Junior) Security Engineer (m/w/d)
@ CHECK24 | Berlin, Germany
Cyber Security
@ Necurity Solutions | Bengaluru, Karnataka, India