Sciweavers

55 search results - page 10 / 11
» crypto 2004
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
Gilad Asharov, Yehuda Lindell
EUROCRYPT
2009
Springer
15 years 10 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
FSE
2004
Springer
130views Cryptology» more  FSE 2004»
15 years 2 months ago
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
Simon R. Blackburn, Kenneth G. Paterson
INDOCRYPT
2004
Springer
15 years 2 months ago
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
Abstract. The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on mul...
David A. McGrew, John Viega