Sciweavers

199 search results - page 16 / 40
» Adaptive Proofs of Knowledge in the Random Oracle Model
Sort
View
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
15 years 2 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
2006
108views more  IEICET 2006»
14 years 11 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
IJISEC
2007
88views more  IJISEC 2007»
14 years 11 months ago
Secure group key establishment revisited
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, ...
ASIACRYPT
2000
Springer
15 years 3 months ago
A New Forward-Secure Digital Signature Scheme
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
Michel Abdalla, Leonid Reyzin
ASIACRYPT
2009
Springer
15 years 3 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz