The round complexity of verifiable secret sharing and secure multicast

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 580-589

  Gennaro, R ^a   Ishai, Y ^a   Kushilevitz, E ^a   Rabin, T ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; INFORMATION THEORY; MULTICASTING; NETWORK PROTOCOLS; SECURITY OF DATA; SET THEORY; STATISTICAL METHODS;

ROUND COMPLEXITY; SECRET SHARING;

COMPUTATIONAL COMPLEXITY;

EID: 0034830283     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380853     Document Type: Conference Paper

References (44)

1. Non-cryptographic fault-tolerant computing in a constant number of rounds
2. Multiparty protocols tolerating half faulty processors
3. Minimal-latency secure function evaluation
4. Locally random reductions: Improvements and applications
5. Cryptographic protocols provably secure against dynamic adversaries
6. The round complexity of secure protocols (extended abstract)
7. Completeness theorems for noncryptographic fault-tolerant distributed computations
8. Fast consensus in networks of bounded degree
9. Bit optimal distributed consensus
10. Safeguarding cryptographic keys
11. Noninteractive zero-knowledge
12. One-round secure computation and secure autonomous mobile agents
13. Security and composition of multiparty cryptographic protocols
14. Adaptively secure multi-party computation
15. Issues in Secure Multicast
16. Multiparty unconditionally secure protocols
17. Verifiable secret sharing and achieving simultaneity in the presence of faults
18. On the complexity of verifiable secret sharing and multiparty computation
19. Efficient multiparty computations with dishonest minority
20. General secure multiparty computation from any linear secret sharing scheme
21. Perfectly secure message transmission
22. Strong verifiable secret sharing
23. On verification in secret sharing
24. A minimal model for secure computation (extended abstract)
25. A practical scheme for non-interactive verifiable secret sharing
26. From partial consistency to global broadcast
27. Secure communication in minimal connectivity models
28. How to play any mental game
29. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
30. Private simultaneous messages protocols with applications
31. Randomizing polynomials: A new representation with applications to round-efficient secure computation
32. Secret sharing schemes realizing general access structures
33. The Byzantine generals problem
34. Secure computation
35. Reaching agreement in the presence of faults
36. Non-interactive and information-theoretic secure verifiable secret sharing
37. Robust sharing of secrets when the dealer is honest or faulty
38. Verifiable secret sharing and multiparty protocols with honest majority
39. Non-interactive cryptocomputing for NC1
40. How to share a secret
41. How to generate and exchange secrets