Probabilistic Polynomial-Time Equivalence and Security Analysis
- 17 September 1999
- book chapter
- Published by Springer Nature
- p. 776-793
- https://doi.org/10.1007/3-540-48119-2_43
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A linguistic characterization of bounded oracle computation and probabilistic polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mechanized proofs for a recursive authentication protocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A probabilistic poly-time framework for protocol analysisPublished by Association for Computing Machinery (ACM) ,1998
- Analyzing the Needham-Schroeder Public Key Protocol: A Comparison of Two ApproachesPublished by Defense Technical Information Center (DTIC) ,1996
- Three systems for cryptographic protocol analysisJournal of Cryptology, 1994
- The chemical abstract machinePublished by Association for Computing Machinery (ACM) ,1990
- A logic of authenticationProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981
- Using encryption for authentication in large networks of computersCommunications of the ACM, 1978