Composition and integrity preservation of secure reactive systems

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2000, Pages 245-254

  Pfitzmann, B ^a   Waidner, M ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Cryptography; Simulatability

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; LOGIC PROGRAMMING; REAL TIME SYSTEMS; REQUIREMENTS ENGINEERING; SECURITY OF DATA; SECURITY SYSTEMS;

FORMAL VERIFICATION METHOD; NONREACTIVE SIMULATABILITY; SECURE REACTIVE SYSTEMS;

CRYPTOGRAPHY;

EID: 0034447081     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/352600.352639     Document Type: Conference Paper

References (30)

1. A calculus for cryptographic protocols: The spi calculus
2. Reconciling two views of cryptography (The computational soundness of formal encryption)
3. Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority
4. A modular approach to the design and analysis of authentication and key exchange protocols
5. Relations among notions of security for public-key encryption schemes
6. Security and composition of multiparty cryptographic protocols
7. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
8. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
9. On the security of public key protocols
10. Verifiable secret sharing as secure computation
11. Secure multi-party computation
12. Fair computation of general functions in presence of immoral majority
13. The knowledge complexity of interactive proof systems
14. How to play any mental game-or-A completeness theorem for protocols with honest majority
15. Player simulation and general adversary structures in perfect multiparty computation
16. A probabilistic poly-time framework for protocol analysis
17. Probabilistic polynomial-time equivalence and security analysis
18. Breaking and fixing the Needham-Schroeder public-key protocol using FDR
19. Distributed algorithms
20. Using narrowing in the analysis of key management protocols
21. Secure computation
22. The interrogator: A tool for cryptographic protocol security
23. Sorting out signature schemes
24. Secure reactive systems
25. Provably secure certified mail
26. Cryptographic security of reactive systems
27. A general framework for formal notions of "secure" system
28. Modelling and verifying key-exchange protocols using CSP and FDR
29. Protocols for secure computations
30. Theory and applications of trapdoor functions