Sciweavers

CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
CRYPTO
2000
Springer
123views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
Abstract. We describe a series of new attacks on a CBC-MAC algorithm due to Knudsen and Preneel including two key recovery attacks and a forgery attack. Unlike previous attacks, th...
Don Coppersmith, Lars R. Knudsen, Chris J. Mitchel...
CRYPTO
2000
Springer
81views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Optimistic Fair Secure Computation
Christian Cachin, Jan Camenisch
CRYPTO
2000
Springer
99views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Timed Commitments
Dan Boneh, Moni Naor
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
CRYPTO
2000
Springer
184views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator ca...
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene ...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi