TCC
2004
Springer
14 years 5 months ago
2004
Springer
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...
TCC
2004
Springer
14 years 5 months ago
2004
Springer
TCC
2004
Springer
14 years 5 months ago
2004
Springer
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...
TCC
2004
Springer
14 years 5 months ago
2004
Springer
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 ...
TCC
2004
Springer
14 years 5 months ago
2004
Springer
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...
SCN
2004
Springer
14 years 5 months ago
2004
Springer
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...
PKC
2004
Springer
14 years 5 months ago
2004
Springer
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 ...
PKC
2004
Springer
14 years 5 months ago
2004
Springer
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...
PKC
2004
Springer
14 years 5 months ago
2004
Springer
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...
PKC
2004
Springer
14 years 5 months ago
2004
Springer
