Universally composable security: A new paradigm for cryptographic protocols

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 136-145

  Canetti, R ^a  

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

Author keywords

Concurrent composition; Cryptographic protocols; Security analysis of protocols

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

CRYPTOGRAPHIC PROTOCOLS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0035163054     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959888     Document Type: Conference Paper

References (61)

1. A calculus for cryptographic protocols: The spi calculus
2. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority
3. Adaptive zero-knowledge and computational equivocation
4. Cryptographic protocols provably secure against dynamic adversaries
5. A modular approach to the design and analysis of authentication and key-exchange protocols
6. Relations among notions of security for public-key encryption schemes
7. Entity authentication and key distribution
8. Asynchronous secure computations
9. Completeness theorems for non-cryptographic fault-tolerant distributed computation
10. Asynchronous secure computations with optimal resilience
11. Non-interactive zero-knowledge and its applications
12. Minimum disclosure proofs of knowledge
13. A logic for authentication
14. Security and composition of multi-party cryptographic protocols
15. Universally composable security: A new paradigm for cryptographic protocols
16. Universally composable commitments
17. Analysis of key exchange protocols and their use for building secure channels
18. Adaptively secure computation
19. How to maintain authenticated communication
20. Randomness vs. fault-tolerance
21. Efficient multiparty computations secure against an adaptive adversary
22. Non-interactive and non-malleable commitment
23. Secure computation
24. Non-malleable cryptography
25. On the security of public-key protocols
26. Magic functions
27. Concurrent zero-knowledge
28. A randomized protocol for signing contracts
29. Efficient non-malleable commitment schemes
30. Concurrent oblivious transfer
31. Verifiable secret sharing as secure computation
32. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
33. On the composition of zero-knowledge proof systems
34. How to play any mental game
35. Definitions and properties of zero-knowledge proof systems
36. Fair computation of general functions in presence of immoral majority
37. Probabilistic encryption
38. The knowledge complexity of interactive proof systems
39. A digital signature scheme secure against adaptive chosen-message attacks
40. Complete characterization of adversaries tolerable in secure multi-party computation
41. Three systems for cryptographic protocol analysis
42. A probabilistic poly-time framework for protocol analysis
43. Probabilistic polynomial-time equivalence and security analysis
44. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR
45. Formal verification of cryptographic protocols: A survey
46. Secure computation
47. Public key cryptosystems provably secure against chosen ciphertext attacks
48. Secure reactive systems
49. Provably Secure Certified Mail
50. Composition and integrity preservation of secure reactive systems
51. A model for asynchronous reactive systems and its application to secure message transmission
52. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority
53. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack