Sciweavers

61 search results - page 1 / 13
» A Machine-Checked Formalization of the Random Oracle Model
Sort
View
CADE
2004
Springer
14 years 5 months ago
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model
Gilles Barthe, Jan Cederquist, Sabrina Tarento
TYPES
2004
Springer
13 years 10 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
ESORICS
2005
Springer
13 years 10 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
ESORICS
2009
Springer
14 years 5 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
JOC
2007
129views more  JOC 2007»
13 years 4 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng