Cryptography Research       

links

 Shai Halevi photo Heqing Huang photoTal  Rabin photo

Cryptography Research Publications



2011

Verifiable Delegation of Computation over Large Datasets
Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis
CRYPTO 2011, pp. 111--131, Springer LNCS

Tree-based HB protocols for privacy-preserving authentication of RFID tags
T Halevi, N Saxena, S Halevi
Journal of Computer Security 19(2), 343--363, IOS Press, 2011

Composable Security Analysis of OS Services
Ran Canetti, Suresh Chari, Shai Halevi, Birgit Pfitzmann, Arnab Roy, Michael Steiner and Wietse Venema
Proceedings of ACNS 2011, LNCS vol. 6715, pp. 431~448 , Springer


Implementing Gentry’s fully-homomorphic encryption scheme
C Gentry, S Halevi
Advances in Cryptology--EUROCRYPT 2011, 129--148, Springer

Relations between the security models for certificateless encryption and ID-based key agreement
D Fiore, R Gennaro, NP Smart
International Journal of Information Security, 1--22, Springer, 2011

Fully Non-interactive Onion Routing with Forward-Secrecy
D Catalano, M Di Raimondo, D Fiore, R Gennaro, O Puglisi
Applied Cryptography and Network Security, pp. 255--273, 2011


2010

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack.
Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup
J. of Cryptology 23(1), 91-120, Springer, 2010

Identity-based key exchange protocols without pairings
D Fiore, R Gennaro
Transactions on computational science X, 42--77, Springer, 2010

Automata evaluation and text search protocols with simulation based security
R Gennaro, C Hazay, J S Sorensen
Public Key Cryptography, pp. 145--160, 2010

Designing a side channel resistant random number generator
S Chari, V Diluoffo, P Karger, E Palmer, T Rabin, J Rao, P Rohotgi, H Scherzer, M Steiner, D Toll
Smart Card Research and Advanced Application, 49--64, Springer, 2010

Protecting circuits from leakage: The computationally-bounded and noisy cases
S Faust, T Rabin, L Reyzin, E Tromer, V Vaikuntanathan
Advances in Cryptology--EUROCRYPT 2010, 135--156, Springer

Information-Theoretically Secure Protocols and Security Under Composition
E Kushilevitz, Y Lindell, T Rabin
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 2090--2112, Citeseer, 2010

Cryptographic Extraction and Key Derivation: The HKDF Scheme
Hugo Krawczyk
2010
\urlhttp://eprint.iacr.org/2010/264

Almost optimal bounds for direct product threshold theorem
C Jutla
Theory of Cryptography, 37--51, Springer, 2010

One-Pass HMQV and Asymmetric Key-Wrapping
Shai Halevi, Hugo Krawczyk
2010
\urlhttp://eprint.iacr.org/2010/638

Where Do You Want to Go Today? Escalating Privileges by Pathname Manipulation
Suresh Chari, Shai Halevi, Wietse Venema
17th Annual Network and Distributed System Security Symposium (NDSS), 2010


i-hop homomorphic encryption and rerandomizable Yao circuits
C Gentry, S Halevi, V Vaikuntanathan
Advances in Cryptology--CRYPTO 2010, 155--172, Springer

Toward basing fully homomorphic encryption on worst-case hardness
C Gentry
Advances in Cryptology--CRYPTO 2010, 116--137, Springer

A simple BGN-type cryptosystem from LWE
C Gentry, S Halevi, V Vaikuntanathan
Advances in Cryptology--EUROCRYPT 2010, 506--522, Springer

Computing arbitrary functions of encrypted data
C Gentry
Communications of the ACM 53(3), 97--105, ACM, 2010

Fully homomorphic encryption over the integers
M Van Dijk, C Gentry, S Halevi, V Vaikuntanathan
Advances in Cryptology--EUROCRYPT 2010, 24--43, Springer

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead"
R Gennaro, H Krawczyk, T Rabin
Applied Cryptography and Network Security: 8th International Conference, ACNS 2010, , pp. 309

Making the Diffie-Hellman protocol identity-based
D Fiore, R Gennaro
Topics in Cryptology-CT-RSA 2010, 165--178, Springer

Non-interactive verifiable computing: Outsourcing computation to untrusted workers
R Gennaro, C Gentry, B Parno
Advances in Cryptology--CRYPTO 2010, 465--482, Springer

Constructing certificateless encryption and id-based encryption from id-based key agreement
D Fiore, R Gennaro, N Smart
4th International Conference,, pp. 167--186, Springer, 2010


2009

The round complexity of verifiable secret sharing revisited
A Patra, A Choudhary, T Rabin, C Rangan
Advances in Cryptology-CRYPTO 2009, 487--504, Springer

Testing low-degree polynomials over prime fields
C S Jutla, A C Patthak, A Rudra, D Zuckerman
Annual Symposium on Foundations of Computer Science, pp. 163--193, Wiley Online Library, 2009

Attacking cryptographic schemes based on perturbation polynomials
M Albrecht, C Gentry, S Halevi, J Katz
Proceedings of the 16th ACM conference on Computer and communications security, pp. 1--10, 2009

Hierarchical identity based encryption with polynomially many levels
C Gentry, S Halevi
Theory of Cryptography, 437--456, Springer, 2009

Adaptive security in broadcast encryption systems (with short ciphertexts)
C Gentry, B Waters
Advances in Cryptology-EUROCRYPT 2009, 171--188, Springer

Fully homomorphic encryption using ideal lattices
C Gentry
Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 169--178, 2009

More on Key Wrapping
R Gennaro, S Halevi
Selected Areas in Cryptography, pp. 53--70, 2009

New Approaches for Deniable Authentication.
Mario Di Raimondo, Rosario Gennaro
J. of Cryptology 22(4), 572-615, Springer, 2009

Certificateless onion routing
D Catalano, D Fiore, R Gennaro
Proceedings of the 16th ACM conference on Computer and communications security, pp. 151--160, 2009

Secure Network Coding Over the Integers
Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin
2009
\urlhttp://eprint.iacr.org/2009/569


2008

Storage Encryption: A Cryptographer’s View
S Halevi
Security and Cryptography for Networks, 1--1, Springer Berlin/Heidelberg, 2008

On seed-incompressible functions
S Halevi, S Myers, C Rackoff
Proceedings of the 5th conference on Theory of cryptography, pp. 19--36, 2008

Degradation and amplification of computational hardness
S Halevi, T Rabin
Theory of Cryptography, 626--643, Springer, 2008

Rationality and traffic attraction: Incentives for honest path announcements in BGP
S Goldberg, S Halevi, A D Jaggard, V Ramachandran, R N Wright
ACM SIGCOMM Computer Communication Review 38(4), 267--278, ACM, 2008

Circular-secure encryption from decision diffie-hellman
D Boneh, S Halevi, M Hamburg, R Ostrovsky
Advances in Cryptology--CRYPTO 2008, 108--125, Springer

Trapdoors for hard lattices and new cryptographic constructions
C Gentry, C Peikert, V Vaikuntanathan
Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 197--206, 2008

Off-line/on-line signatures: theoretical aspects and experimental results
D Catalano, M Di Raimondo, D Fiore, R Gennaro
PKC 2008, pp. 101--120

Paillier's trapdoor function hides up to O (n) bits
D Catalano, R Gennaro, N Howgrave-Graham
Journal of cryptology 15(4), 251--269, Springer, 2008

Threshold RSA for Dynamic and Ad-Hoc Groups
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin
2008
\urlhttp://eprint.iacr.org/2008/045

Faster and shorter password-authenticated key exchange
R Gennaro
Theory of Cryptography, 589--606, Springer, 2008

Strongly-Resilient and Non-Interactive Hierarchical Key-Agreement in MANETs
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin, Steffen Reidt, Stephen D. Wolthusen
2008
\urlhttp://eprint.iacr.org/2008/308

Tag-KEM/DEM: A new framework for hybrid encryption
M Abe, R Gennaro, K Kurosawa
Journal of Cryptology 21(1), 97--130, Springer, 2008


2007

Provably good codes for hash function design
C Jutla, A Patthak
Selected Areas in Cryptography, pp. 376--393, Springer, 2007

Invertible universal hashing and the TET encryption mode
S Halevi
Advances in Cryptology-CRYPTO 2007, 412--429, Springer

Security under Key-Dependent Inputs
Shai Halevi, Hugo Krawczyk
2007
\urlhttp://eprint.iacr.org/2007/315

A forward-secure public-key encryption scheme
R Canetti, S Halevi, J Katz
Journal of Cryptology 20(3), 265--294, Springer, 2007

Improved On-Line/OfF-Line Threshold Signatures
E Bresson, D Catalano, R Gennaro
Public Key Cryptography--PKC 2007, 217--232, Springer

Cramer-Damgard signatures revisited: Efficient flat-tree signatures based on factoring.
Dario Catalano, Rosario Gennaro
Theoretical Computer Science 370(1-3), 186-200, 2007

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
Journal of Cryptology 20(1), 51--83, Springer, Heidelberg, Germany, 2007


2006

The RMX transform and digital signatures
S Halevi, H Krawczyk
The Second Cryptographic Hash Workshop, Santa Barbara, CA, USA, 2006

PRF domain extension using dags
C Jutla
Theory of Cryptography3876, 561--580, Springer, 2006

Parallelizable authentication trees
W Hall, C Jutla
Selected Areas in Cryptography, pp. 95--109, Springer, 2006

Mitigating dictionary attacks on password-protected local storage
R Canetti, S Halevi, M Steiner
Advances in Cryptology-CRYPTO 2006, 160--179, Springer

Chosen ciphertext secure public key threshold encryption without random oracles
D Boneh, X Boyen, S Halevi
Topics in Cryptology--CT-RSA 2006, 226--243, Springer

Strengthening Digital Signatures Via Randomized Hashing
Shai Halevi, Hugo Krawczyk
Advances in Cryptology -- CRYPTO" " "CRYPTO 2006"2006, pp. 41--59, springer

Randomness in cryptography
R Gennaro
IEEE security \& privacy, 64--67, IEEE Computer Society, 2006

Independent zero-knowledge sets
R Gennaro, S Micali
Automata, Languages and Programming, 34--45, Springer, 2006

A framework for password-based authenticated key exchange
R Gennaro, Y Lindell
ACM Transactions on Information and System Security (TISSEC) 9(2), 181--234, ACM, 2006

Bounds on the efficiency of generic cryptographic constructions
R Gennaro, Y Gertner, J Katz, L Trevisan
SIAM Journal on Computing 35(1), 217--246, 2006

Deniable Authentication and Key Exchange
Mario Di Raimondo, Rosario Gennaro, Hugo Krawczyk
2006
\urlhttp://eprint.iacr.org/2006/280


2005

HMQV: A High-Performance Secure Diffie-Hellman Protocol
Hugo Krawczyk
2005
\urlhttp://eprint.iacr.org/2005/176

A model and architecture for pseudo-random generation with applications to/dev/random
B Barak, S Halevi
Proceedings of the 12th ACM conference on Computer and communications security, pp. 203--212, 2005

EME*: Extending EME to handle arbitrary-length messages with associated data
S Halevi
Progress in Cryptology-INDOCRYPT 2004, 445--462, Springer, 2005

Hardness amplification of weakly verifiable puzzles
R Canetti, S Halevi, M Steiner
Theory of Cryptography, 17--33, Springer, 2005

Universally composable password-based key exchange
R Canetti, S Halevi, J Katz, Y Lindell, P MacKenzie
Advances in Cryptology--EUROCRYPT 2005, 404--421, Springer

Cramer-Damg{\aa}rd signatures revisited: Efficient flat-tree signatures based on factoring
D Catalano, R Gennaro
Public Key Cryptography-PKC 2005, 313--327, Springer

Secure off-the-record messaging
M Di Raimondo, R Gennaro, H Krawczyk
Proceedings of the 2005 ACM workshop on Privacy in the electronic society, pp. 81--89

An improved pseudo-random generator based on the discrete logarithm problem
R Gennaro
Journal of Cryptology 18(2), 91--110, Springer, 2005

Tag-KEM/DEM: A new framework for hybrid encryption and a new analysis of Kurosawa-Desmedt KEM
M Abe, R Gennaro, K Kurosawa, V Shoup
Advances in Cryptology--EUROCRYPT 2005, 128--146, Springer

Secure multiplication of shared secrets in the exponent
R Gennaro, M Di Raimondo
Information processing letters 96(2), 71--79, Elsevier, 2005


2004

Batching schnorr identification scheme with applications to privacy-preserving authorization and low-bandwidth communication devices
R Gennaro, D Leigh, R Sundaram, W Yerazunis
Advances in Cryptology-ASIACRYPT 2004, 187--198, Springer

Lower bound on linear authenticated encryption
C S Jutla
Selected Areas in Cryptography, pp. 348--360, Springer, 2004

Adaptively-Secure, Non-Interactive Public-Key Encryption
R Canetti, S Halevi, J Katz
Model reduction methods for vector autoregressive processes, 150, Springer Verlag, 2004

Chosen-ciphertext security from identity-based encryption
R Canetti, S Halevi, J Katz
Advances in Cryptology-Eurocrypt 2004, pp. 207--222

On the random-oracle methodology as applied to length-restricted signature schemes
R Canetti, O Goldreich, S Halevi
Theory of Cryptography, 40--57, Springer, 2004

A parallelizable enciphering mode
S Halevi, P Rogaway
Topics in Cryptology--CT-RSA 2004, 1995--1995, Springer


Secure Hashed Diffie-Hellman over Non-DDH Groups
Rosario Gennaro, Hugo Krawczyk, Tal Rabin
2004
\urlhttp://eprint.iacr.org/2004/099

Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering
R Gennaro, A Lysyanskaya, T Malkin, S Micali, T Rabin
Theory of Cryptography, 258--277, Springer, 2004

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
Yevgeniy Dodis, Rosario Gennaro, Johan H\aastad, Hugo Krawczyk, Tal Rabin
Advances in Cryptology -- CRYPTO" " "CRYPTO 2004"2004, pp. 494--510, springer


2003

Universal composition with joint state
Ran Canetti, Tal Rabin
Advances in Cryptology-Crypto 2003, pp. 265--281, Springer

Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card
Helmut Scherzer, Ran Canetti, Paul A. Karger, Hugo Krawczyk, Tal Rabin, David C. Toll
ESORICS "ESORICS 2003"2003: 8th " "European Symposium on Research in Computer Security, pp. 181--200, springer

SIGMA: The ‘SIGn-and-MAc’approach to authenticated Diffie-Hellman and its use in the IKE protocols
H Krawczyk
Advances in Cryptology-CRYPTO 2003, 400--425, Springer

Relaxing Chosen-Ciphertext Security
Ran Canetti, Hugo Krawczyk, Jesper Nielsen
2003
\urlhttp://eprint.iacr.org/2003/174

A tweakable enciphering mode
S Halevi, P Rogaway
Advances in Cryptology-CRYPTO 2003, 482--499, Springer

Lower bounds on the efficiency of encryption and digital signature schemes
R Gennaro, Y Gertner, J Katz
ACM STOC 2003, pp. 417--425

Secure applications of Pedersen’s distributed key generation protocol
R Gennaro, S Jarecki, H Krawczyk, T Rabin
Topics in Cryptology—CT-RSA 2003, 373--390, Springer

Provably secure threshold password-authenticated key exchange
M Di Raimondo, R Gennaro
Advances in Cryptology—EUROCRYPT 2003 72(6), 646--646, Springer

A framework for password-based authenticated key exchange
R Gennaro, Y Lindell
Advances in Cryptology—EUROCRYPT 2003, 648--648, Springer


2002

On the security of joint signature and encryption
Jee Hea An, Yevgeniy Dodis, Tal Rabin
Advances in Cryptology—EUROCRYPT 2002, pp. 83--107

Sequential composition of protocols without simultaneous termination
Y Lindell, A Lysyanskaya, T Rabin
Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 203--212, 2002

On the composition of authenticated byzantine agreement
Y Lindell, A Lysyanskaya, T Rabin
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 514--523, 2002

Universally Composable Notions of Key Exchange and Secure Channels
Ran Canetti, Hugo Krawczyk
2002
\urlhttp://eprint.iacr.org/2002/059

Security analysis of IKE’s signature-based key-exchange protocol
R Canetti, H Krawczyk
Advances in Cryptology—CRYPTO 2002, 27--52, Springer

A two layered approach for securing an object store network
A Azagury, R Canetti, M Factor, S Halevi, E Henis, D Naor, N Rinetzky, O Rodeh, J Satran
Security in Storage Workshop, 2002, pp. 10--23

Scream: A software-efficient stream cipher
S Halevi, D Coppersmith, C Jutla
Fast Software Encryption, pp. 195--209, Springer, 2002

Cryptanalysis of stream ciphers with linear masking
D Coppersmith, S Halevi, C Jutla
Advances in Cryptology—CRYPTO 2002, 117--128, Springer

Cryptanalysis of a pseudorandom generator based on braid groups
R Gennaro, D Micciancio
Advances in Cryptology—EUROCRYPT 2002, pp. 1--13

On 2-round secure multiparty computation
R Gennaro, Y Ishai, E Kushilevitz, T Rabin
Advances in Cryptology—Crypto 2002, 129--148, Springer

Securing threshold cryptosystems against chosen ciphertext attack
R Gennaro, V Shoup
Journal of Cryptology 15(2), 75-96, 2002


2001

Fair e-Lotteries and e-Casinos
E Kushilevitz, T Rabin
Topics in Cryptology—CT-RSA 2001, 100--109, Springer

Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Ran Canetti, Hugo Krawczyk
2001
\urlhttp://eprint.iacr.org/2001/040

Encryption modes with almost free message integrity
C Jutla
Advances in Cryptology—EUROCRYPT 2001 21(4), 529--544, Springer

Efficient Rijndael encryption implementation with composite field arithmetic
Atri Rudra, Pradeep K Dubey, Charanjit S Jutla, Vijay Kumar, Josyula R Rao, Pankaj Rohatgi
Cryptographic Hardware and Embedded Systems—CHES 2001, pp. 171--184, Springer

Incremental codes
Y Dodis, S Halevi
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 75--90, Springer, 2001

The modular inversion hidden number problem
D Boneh, S Halevi, N Howgrave-Graham
Advances in Cryptology—ASIACRYPT 2001, 36--51, Springer

Private approximation of NP-hard functions
S Halevi, R Krauthgamer, E Kushilevitz, K Nissim
Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 550--559, 2001

Pseudo-random number generation on the IBM 4758 Secure Crypto Coprocessor
N Howgrave-Graham, J Dyer, R Gennaro
Cryptographic Hardware and Embedded Systems—CHES 2001, pp. 93--102

The bit security of Paillier’s encryption scheme and its applications
D Catalano, R Gennaro, N Howgrave-Graham
Advances in Cryptology—EUROCRYPT 2001, 229--243, Springer

How to Sign Digital Streams
R Gennaro, P Rohatgi
Information and Computation 165(1), 100--116, Elsevier, 2001

The round complexity of verifiable secret sharing and secure multicast
R Gennaro, Y Ishai, E Kushilevitz, T Rabin
ACM STOC 2001, pp. 580--589

Paillier's cryptosystem revisited
D Catalano, R Gennaro, N Howgrave-Graham, P Q Nguyen
Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 206--214, 2001


2000

Design, implementation, and deployment of the iKP secure electronic payment system
M Bellare, J A Garay, R Hauser, A Herzberg, H Krawczyk, M Steiner, G Tsudik, E Van Herreweghen, M Waidner
Selected Areas in Communications, IEEE Journal on 18(4), 611--627, IEEE, 2000

Chameleon Signatures
Hugo Krawczyk, Tal Rabin
ISOC Network and Distributed System Security Symposium -- NDSS" " "NDSS 2000"2000, The Internet Society

A cryptographic solution to a game theoretic problem
Y Dodis, S Halevi, T Rabin
Advances in Cryptology—CRYPTO 2000, pp. 112--130

Exposure-resilient functions and all-or-nothing transforms
R Canetti, Y Dodis, S Halevi, E Kushilevitz, A Sahai
Advances in Cryptology—EUROCRYPT 2000, pp. 453--469

Clock synchronization with faults and recoveries
B Barak, S Halevi, A Herzberg, D Naor
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, pp. 133--142, 2000

Robust watermarking for images based on color manipulation
S Battiato, D Catalano, G Gallo, R Gennaro
Information Hiding, pp. 302--317, 2000

An improved pseudo-random generator based on discrete log
R Gennaro
Advances in Cryptology—CRYPTO 2000, pp. 469--481

Secure distributed storage and retrieval* 1
J A Garay, R Gennaro, C Jutla, T Rabin
Theoretical Computer Science 243(1-2), 363--389, Elsevier, 2000

Computing inverses over a shared secret modulus
D Catalano, R Gennaro, S Halevi
Advances in Cryptology—Eurocrypt 2000, pp. 190--206

Secure distributed storage and retrieval
J A Garay, R Gennaro, C Jutla, T Rabin
Theoretical Computer Science 243(1-2), 363--389, Elsevier , 2000

Lower bounds on the efficiency of generic cryptographic constructions
R Gennaro, L Trevisan
IEEE FOCS 2000, pp. 305--313


1999

Efficient multiparty computations secure against an adaptive adversary
Ronald Cramer, Ivan Damg\aard, Stefan Dziembowski, Martin Hirt, Tal Rabin
Advances in Cryptology—EUROCRYPT’99, pp. 311--326, 1999

Blinding of Credit Card Numbers in the SET Protocol
Hugo Krawczyk
"FC'99: 3rd " fcname_v1, pp. 17--28, springer, 1999

Untraceable mobility or how to travel incognito1
G Ateniese, A Herzberg, H Krawczyk, G Tsudik
Computer Networks 31(8), 871--884, Elsevier, 1999

Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier
Mihir Bellare, Oded Goldreich, Hugo Krawczyk
Advances in Cryptology -- CRYPTO" "'99, pp. 270--287, springer, 1999

Towards sound approaches to counteract power-analysis attacks
Suresh Chari, Charanjit S Jutla, Josyula R Rao, Pankaj Rohatgi
Advances in Cryptology—CRYPTO’99, pp. 398--412, 1999

UMAC: Fast and Secure Message Authentication
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovetz, Phillip Rogaway
Advances in Cryptology -- CRYPTO" "'99, pp. 216--233, springer, 1999

Public-Key Cryptography and Password Protocols
Shai Halevi, Hugo Krawczyk
ACM Transactions on Information and System Security 2(3), 230--268, 1999

Secure key recovery
R Gennaro, P Karger, S Matyas, M Peyravian, A Roginsky, D Safford, M Willett, N Zunic
IBM Thomas J. Watson Research Center, Citeseer, 1999

Secure distributed key generation for discrete-log based cryptosystems. Advances in Cryptology-Eurocrypt’99, LNCS 1592
R Gennaro, S Jarecki, H Krawczyk, T Rabin
1999 - Springer-Verlag, Springer-Verlag

Adaptive Security for Threshold Cryptosystems
Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
Advances in Cryptology -- CRYPTO" "'99, pp. 98--115, springer, 1999

Secure hash-and-sign signatures without the random oracle
Rosario Gennaro, Shai Halevi, Tal Rabin
Advances in Cryptology—EUROCRYPT’99, pp. 123--139, 1999


1998

Securing Threshold Cryptosystems against Chosen Ciphertext Attack.
Victor Shoup, Rosario Gennaro:
EUROCRYPT 2008, Springer, 1998

Batch verification with applications to cryptography and checking
M Bellare, J Garay, T Rabin
LATIN'98: Theoretical Informatics, 170--191, Springer, 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols
Mihir Bellare, Ran Canetti, Hugo Krawczyk
1998
\urlhttp://eprint.iacr.org/1998/009

A simplified approach to threshold and proactive RSA
Tal Rabin
Advances in Cryptology—CRYPTO'98, pp. 89--104, 1998

Fast batch verification for modular exponentiation and digital signatures
Mihir Bellare, Juan A Garay, Tal Rabin
Advances in Cryptology—EUROCRYPT'98, pp. 236--250, Springer, 1998

A security architecture for the internet protocol
P C Cheng, J A Garay, A Herzberg, H Krawczyk
IBM Systems Journal 37(1), 42--60, IBM, 1998

Generalized birthday attacks on unbalanced Feistel networks
C Jutla
Advances in Cryptology—CRYPTO'98, pp. 186--199, Springer, 1998

Many-to-one trapdoor functions and their relation to public-key cryptosystems
M Bellare, S Halevi, A Sahai, S Vadhan
Advances in Cryptology—CRYPTO'98, pp. 283--298, 1998

The Mars Encryption Algorithm
C Burwick, D Coppersmith, E D’Avignon, R Gennaro, S Halevi, C Jutla, S M Matyas, L O’Connor, M Peyravian, D Safford, others
NIST AES Proposal, Citeseer, 1998

New efficient and secure protocols for verifiable signature sharing and other applications
D Catalano, R Gennaro
Advances in Cryptology—CRYPTO'98, pp. 105--120, 1998

An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
R Gennaro, D Micciancio, T Rabin
Proceedings of the 5th ACM conference on Computer and communications security, pp. 67--72, 1998

MARS-a candidate cipher for AES
C Burwick, D Coppersmith, E D’Avignon, R Gennaro, S Halevi, C Jutla, S M Matyas Jr, L O’Connor, M Peyravian, D Safford, others
NIST AES Proposal, Citeseer, 1998

Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Rosario Gennaro, Michael O Rabin, Tal Rabin
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp. 101--111, 1998


1997

Maintaining authenticated communication in the presence of break-ins
R Canetti, S Halevi, A Herzberg
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pp. 15--24, 1997

MMH: Software Message Authentication in the Gbit/Second Rates
Shai Halevi, Hugo Krawczyk
Fast Software Encryption -- FSE" "'97, pp. 172--189, springer, 1997

Two-phase cryptographic key recovery system
R Gennaro, P Karger, S Matyas, M Peyravian, A Roginsky, D Safford, M Willett, N Zunic
Computers & Security 16(6), 481--506, Elsevier, 1997
US Patent 5,937,066

Proactive security: Long-term protection against break-ins
R Canetti, R Gennaro, A Herzberg, D Naor
RSA CryptoBytes 3(1), 1--8, 1997

How to sign digital streams
R Gennaro, P Rohatgi
CRYPTO'97, pp. 180--197, Springer, 1997

A secure and optimally efficient multi-authority election scheme
R Cramer, R Gennaro, B Schoenmakers
EUROCRYPT'97, pp. 481--490, 1997


1996

Incoercible Multiparty Computation
Ran Canetti, Rosario Gennaro
FOCS'96, 1996

Robust Threshold DSS Signatures
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
EUROCRYPT'96, 1996

Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing
M Bellare, J A Garay, T Rabin
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 191--200, 1996

SKEME: A versatile secure key exchange mechanism for internet
H Krawczyk
Network and Distributed System Security, 1996, pp. 114--127

Keying Hash Functions for Message Authentication
Mihir Bellare, Ran Canetti, Hugo Krawczyk
Advances in Cryptology -- CRYPTO" "'96, pp. 1--15, springer, 1996

Pseudorandom functions revisited: The cascade construction and its concrete security
Mihir Bellare, Ran Canetti, Hugo Krawczyk
37th " "Annual Symposium on Foundations of Computer Science, pp. 514--523, IEEE Computer Society Press, 1996

Robust and Efficient Sharing of RSA Functions
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
CRYPTO'96, 1996

Robust Threshold DSS Signatures
Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
Advances in Cryptology -- EUROCRYPT" "'96, pp. 354--371, springer, 1996