Sciweavers

135 search results - page 2 / 27
» Formal Indistinguishability Extended to the Random Oracle Mo...
Sort
View
TYPES
2004
Springer
13 years 11 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
ASIACRYPT
2000
Springer
13 years 10 months ago
A Length-Invariant Hybrid Mix
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
Miyako Ohkubo, Masayuki Abe
SP
2009
IEEE
14 years 14 days ago
Sphinx: A Compact and Provably Secure Mix Format
Sphinx is a cryptographic message format used to relay anonymized messages within a mix network. It is more compact than any comparable scheme, and supports a full set of security...
George Danezis, Ian Goldberg
JOC
2007
129views more  JOC 2007»
13 years 5 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
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
13 years 10 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson