Sciweavers

Share
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
9 years 1 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
9 years 1 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
9 years 1 months ago
On the Possibility of One-Message Weak Zero-Knowledge
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Boaz Barak, Rafael Pass
TCC
2004
Springer
118views Cryptology» more  TCC 2004»
9 years 1 months ago
A General Composition Theorem for Secure Reactive Systems
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
Michael Backes, Birgit Pfitzmann, Michael Waidner
SCN
2004
Springer
121views Communications» more  SCN 2004»
9 years 1 months ago
ECRYPT: The Cryptographic Research Challenges for the Next Decade
Abstract. In the past thirty years, cryptology has evolved from a secret art to a modern science. Weaker algorithms and algorithms with short keys are disappearing, political contr...
Bart Preneel
PKC
2004
Springer
106views Cryptology» more  PKC 2004»
9 years 1 months ago
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
Rui Zhang 0002, Goichiro Hanaoka, Junji Shikata, H...
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
9 years 1 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
9 years 1 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
books