Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Open Access
- 1 July 2007
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 186, 49-65
- https://doi.org/10.1016/j.entcs.2006.11.044
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- An efficient cryptographic protocol verifier based on prolog rulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Analysing protocols subject to guessing attacksJournal of Computer Security, 2004
- Athena: a new efficient automatic checker for security protocol analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Casper: a compiler for the analysis of security protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A hierarchy of authentication specificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Protocol insecurity with finite number of sessions is NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Probabilistic encryptionJournal of Computer and System Sciences, 1984