A model for asynchronous reactive systems and its application to secure message transmission

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2001, Pages 184-200

  Pfitzmann, B ^a   Waidner, M ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA; SEMANTICS; THEOREM PROVING;

CRYPTOGRAPHIC SEMANTICS; SECURE MESSAGE TRANSMISSION; SYNCHRONOUS REACTIVE SYSTEMS;

CRYPTOGRAPHY;

EID: 0034823388     PISSN: 10637109     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Reconciling two views of cryptography (The computational soundness of formal encryption)
2. Relations among notions of security for public-key encryption schemes
3. Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority
4. Public-key encryption in a multi-user setting: Security proofs and improvements
5. A modular approach to the design and analysis of authentication and key exchange protocols
6. Cryptographic protocols provably secure against dynamic adversaries
7. Security and composition of multiparty cryptographic protocols
8. A unified framework for analyzing security of protocols
9. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
10. On the security of public key protocols
11. Verifiable secret sharing as secure computation
12. Secure multi-party computation
13. Fair computation of general functions in presence of immoral majority
14. Probabilistic encryption
15. A digital signature scheme secure against adaptive chosen-message attacks
16. The knowledge complexity of interactive proof systems
17. How to play any mental game-or-a completeness theorem for protocols with honest majority
18. Player simulation and general adversary structures in perfect multiparty computation
19. A probabilistic poly-time framework for protocol analysis
20. Probabilistic polynomial-time equivalence and security analysis
21. I/O automaton models and proofs for shared-key communication systems
22. Secure computation
23. Composition and integrity preservation of secure reactive systems
24. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack
25. Probabilistic simulations for probabilistic processes
26. Protocols for secure computations
27. Theory and applications of trapdoor functions