Explicit Randomness is not Necessary when Modeling Probabilistic Encryption

DOI10.1016/j.entcs.2006.11.044zbMath1277.94021OpenAlexW2096943992WikidataQ121073128 ScholiaQ121073128MaRDI QIDQ2866728

Bogdan Warinschi, Heinrich Hördegen, Véronique Cortier

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.11.044

zbMATH Keywords

authenticationencryptionprobabilisticsecrecysecurity modelsprotocol verification

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A survey of symbolic methods in computational analysis of cryptographic systems

Uses Software

• AVISPA
• Casper

Cites Work

• Unnamed Item
• Probabilistic encryption
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Programming Languages and Systems
• Computer Aided Verification
• Theory of Cryptography

This page was built for publication: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption