Completeness Theorems for Adaptively Secure Broadcast
- 9 August 2023
- book chapter
- Published by Springer Nature
- p. 3-38
Abstract
No abstract availableKeywords
This publication has 76 references indexed in Scilit:
- Adaptively Secure Multi-Party Computation with Dishonest MajorityLecture Notes in Computer Science, 2012
- Secure Multi-Party Computation without AgreementJournal of Cryptology, 2005
- Adaptive versus Non-Adaptive Security of Multi-Party ProtocolsJournal of Cryptology, 2004
- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case2002
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Levels of authentication in distributed agreement1996
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980