Sciweavers

27 search results - page 1 / 6
» A Domain Extender for the Ideal Cipher
Sort
View
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
2011
Springer
289views Cryptology» more  FSE 2011»
12 years 8 months ago
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
Martin R. Albrecht, Pooya Farshim, Kenny G. Paters...
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
AAAI
2000
13 years 6 months ago
Defining and Using Ideal Teammate and Opponent Agent Models
A common challenge for agents in multiagent systems is trying to predict what other agents are going to do in the future. Such knowledge can help an agent determine which of its c...
Peter Stone, Patrick Riley, Manuela M. Veloso
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