Sciweavers

51 search results - page 1 / 11
» The Random Oracle Model and the Ideal Cipher Model Are Equiv...
Sort
View
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
Jean-Sébastien Coron, Jacques Patarin, Yann...
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
14 years 1 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
13 years 8 months ago
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
John Black
IEICET
2008
147views more  IEICET 2008»
13 years 4 months ago
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...
Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul ...
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
13 years 9 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