Publications

Cryptography Research Group - Publications

Here is a group bibliography arranged by year. Papers with hyperlinks are available on line.

2008

R.Canetti. Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008 Proceedings, Springer Lecture Notes in Computer Science vol.4948, 2008.

R.Canetti, L.Cheung, D.K.Kaynar, M.Liskov, N.A.Lynch, O.Pereira and R.Segala, Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discrete Event Dynamic Systems 18(1): 111-159 (2008)

D.Coppersmith, J.S.Coron, F.Grieu, S.Halevi, C.S.Jutla, D.Naccache, J.P.Stern, Cryptanalysis of ISO/IEC 9796-1. J. Cryptology 21(1): 27-51 (2008)

S.Halevi, S.Myers and C.Rackoff, On Seed-Incompressible Functions. 2008 Theory of Cryptography Conference (TCC'08): 19-36

S.Halevi and T.Rabin, Degradation and Amplification of Computational Hardness. 2008 Theory of Cryptography Conference (TCC'08): 626-643

D.Catalano, M.Di Raimondo, D.Fiore and R.Gennaro, Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results. 2008 Public Key Cryptography (PKC'08): 101-120

R.Gennaro, Faster and Shorter Password-Authenticated Key Exchange. 2008 Theory of Cryptography Conference (TCC'08): 589-606

M.Abe, R.Gennaro and K.Kurosawa, Tag-KEM/DEM: A New Framework for Hybrid Encryption. J. Cryptology 21(1): 97-130 (2008)

2007

D.Boneh, R.Canetti, S.Halevi and J.Katz: Chosen-Ciphertext Security from Identity-Based Encryption. SIAM J. Comput. 36(5): 1301-1328 (2007)

R.Canetti, S.Halevi and J.Katz: A Forward-Secure Public-Key Encryption Scheme. J. Cryptology 20(3): 265-294 (2007). Preliminary version in EUROCRYPT 2003.

R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. J. of Cryptology 20(1):51-83, January 2007.

D.Catalano and R.Gennaro: Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring. Theor. Comput. Sci. 370(1-3): 186-200 (2007)

R.Canetti: Obtaining Universally Compoable Security: Towards the Bare Bones of Trust. ASIACRYPT 2007: 88-112 (invited talk).

S.Halevi and H.Krawczyk: Security under Key-Dependent Inputs. . 2007 ACM Conference on Computer and Communications Security (CCS'07).

R.Canetti and S.Hohenberger: Chosen-ciphertext secure proxy re-encryption. 2007 ACM Conference on Computer and Communications Security (CCS'07).

R.Canetti, R.L.Rivest, M.Sudan, L.Trevisan, S.P.Vadhan, H.Wee: Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283

S.Halevi: Invertible Universal Hashing and the TET Encryption Mode. CRYPTO 2007:412-429.

E.Bresson, D.Catalano and R.Gennaro: Improved On-Line/Off-Line Threshold Signatures PKC 2007: 217-232.

R.Canetti, Y.Dodis, R.Pass and S.Walfish: Universally Composable Security with Global Setup. TCC 2007: 61-85.

2006

S.Halevi and T.Rabin: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings Springer 2006

Y.Lindell, A.Lysyanskaya and T.Rabin: On the composition of authenticated Byzantine Agreement. J. ACM 53(6): 881-917 (2006)

R.Gennaro and Y.Lindell: A framework for password-based authenticated key exchange. ACM Trans. Inf. Syst. Secur. 9(2): 181-234 (2006)

R.Canetti, E.Kushilevitz and Y.Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptology 19(2): 135-167 (2006)

M.Di Raimondo and R.Gennaro: Provably secure threshold password-authenticated key exchange. J. Comput. Syst. Sci. 72(6): 978-1001 (2006)

R.Gennaro: Randomness in Cryptography. IEEE Security & Privacy 4(2): 64-67 (2006)

M.Di Raimondo, R.Gennaro and H.Krawczyk: Deniable authentication and key exchange. ACM Conference on Computer and Communications Security 2006: 400-409

R.Canetti, S.Halevi and M.Steiner: Mitigating Dictionary Attacks on Password-Protected Local Storage. CRYPTO 2006: 160-179

S.Halevi and H.Krawczyk: Strengthening Digital Signatures Via Randomized Hashing. CRYPTO 2006: 41-59

R.Canetti, L.Cheung, D.K.Kaynar, M.Liskov, N.A.Lynch, O.Pereira and R.Segala: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. DISC 2006: 238-253

R.Gennaro and S.Micali. Independent Zero-Knowledge Sets. 33rd International Colloquium on Automata, Languages and Programming (ICALP'06 - Cryptography Track).

E.Kushilevitz, Y.Lindell and T.Rabin. Information-Theoretically Secure Protocols and Security under Composition. 38th ACM Symposium on Theory of Computing (STOC'06).

D.Boneh, X.Boyen and S.Halevi: Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles. CT-RSA 2006: 226-243

R.Canetti and J.Herzog. Universally Composable Symbolic Analysis of Mutual Authentication and Key Exchange Protocols. 2006 Theory of Cryptography Conference (TCC'06).

2005

R.Gennaro, Y.Gertner, J.Katz and L.Trevisan. Bounds on the efficiency of generic Cryptographic Constructions. SIAM J. on Computing, 35(1):217-246, 2005.

R.Gennaro. An Improved Pseudo-random Generator Based on the Discrete Logarithm Problem. J. of Cryptology, 18(2):91-110, Springer 2005.

M.Di Raimondo, R.Gennaro and H.Krawczyk. The Security of Off-the-Record Messaging. 2005 ACM Workshop on Privacy in the Electronic Society (WPES'05), pp.81-89.

M.Di Raimondo and R.Gennaro. New Approaches in Deniable Authentication. Extended version of the paper that appeared at the 2005 ACM Conference on Computer and Communications Security (CCS'05), pp.112-121.

B.Barak and S.Halevi. A model and architecture for pseudo-random generation with applications to
/dev/random. Extended version of the paper that appeared at the 2005 ACM Conference on Computer and Communications Security (CCS'05), pp.203-212.

H.Krawczyk. HMQV: A High-Performance Secure Diffie-Hellman Protocol. Extended version of the paper that appeared at CRYPTO 2005, Springer LNCS 3621, pp.546-566.

B.Barak, R.Canetti, Y.Lindell, R.Pass and T.Rabin. Secure Computation Without Authentication. CRYPTO 2005, Springer LNCS 3621, pp.361-377.

M.Abe, R.Gennaro, K.Kurosawa and V.Shoup. Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM. EUROCRYPT 2005, Springer LNCS 3494, pp.128-146. This paper was a merger of two separate results available in full version here and here.

R.Canetti, S.Halevi, J.Katz, Y.Lindell and P.D.MacKenzie. Universally Composable Password-Based Key Exchange. Extended version of the paper that appeared at EUROCRYPT 2005, Springer LNCS 3494, pp.404-421.

R.Canetti, S.Halevi and J.Katz. Adaptively-Secure, Non-Interactive Public-Key Encryption. Extended version of the paper that appeared at the 2005 Theory of Cryptography Conference (TCC'05), Springer LNCS 3378, pp.150-168.

R.Canetti, S.Halevi and M.Steiner. Hardness amplification of computational riddles. 2005 Theory of Cryptography Conference (TCC'05), Springer LNCS 3378, pp.17-33.

D.Catalano and R.Gennaro. Cramer-Damgard Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring. 2005 Public Key Cryptography Conference (PKC'05), Springer LNCS 3386, pp.313-327.

2004

R.Canetti, I.Damgard, S.Dziembowsky, Y.Ishai and T.Malkin. On adaptive vs.non-adaptive security of multiparty protocols. J. Cryptology 17(3): 153-207 (2004).

W.Aiello, S.M.Bellovin, M.Blaze, J.Ioannidis, O.Reingold, R.Canetti and A.D.Keromytis. Just fast keying: Key agreement in a hostile internet. ACM Trans. Inf. Syst. Secur. 7(2): 242-273 (2004).

R.Gennaro, D.Leigh, R.Sundaram and W.S.Yerazunis. Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices. ASIACRYPT 2004, Springer LNCS 3329, pp.276-292.

R.Canetti. Universally Composable Signatures, Certification and Authentication. 2004 Computer Security Foundations Workshop (CSFW'04).

R.Gennaro. Multi-trapdoor Commitments and their Applications to Proofs of Knowledge Secure under Concurrent Man-in-the-middle Attacks. CRYPTO 2004, Springer LNCS 3152, pp. 220-236.

Y.Dodis, R.Gennaro, J.Hastad, H.Krawczyk and T.Rabin. Randomness Extraction and Key Derivation using the CBC, Cascade and HMAC modes. CRYPTO 2004, Springer LNCS 3152, pp. 494-510.

R.Gennaro, H.Krawczyk and T.Rabin. Secure Hashed Diffie-Hellman over Non-DDH Groups. EUROCRYPT 2004, Springer LNCS 3027, pp.361-381.

R.Canetti, S.Halevi and J.Katz. Chosen-Ciphertext Security from Identity-Based Encryption.EUROCRYPT 2004, Springer LNCS 3027, pp.207-222.

S.Halevi and P.Rogaway. A Parallelizable Enciphering Mode. 2004 RSA Security Conference - Crypto Track. Springer LNCS 2964, pp.292-304.

R.Gennaro, A.Lysyanskaya, T.Malkin, S.Micali and T.Rabin. Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering. 2004 Theory of Cryptography Conference (TCC'04), Springer LNCS 2951, pp.258-277.

R.Canetti, O.Goldreich and S.Halevi. On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. 2004 Theory of Cryptography Conference (TCC'04), Springer LNCS 2951, pp.40-57.

2003

H.Krawczyk. SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols. CRYPTO 2003, Springer LNCS 2729, pp.400-425.

S.Halevi and P.Rogaway. A Tweakable Enciphering Mode. CRYPTO 2003, Springer LNCS 2729, pp.482-499.

R.Canetti and T.Rabin. Universal Composition with Joint State. CRYPTO 2003, Springer LNCS 2729, pp.265-281.

R.Canetti, H.Krawczyk and J.B.Nielsen.Relaxing Chosen-Ciphertext Security. CRYPTO 2003, Springer LNCS 2729, pp.565-582.

H.Scherzer, R.Canetti, P.A.Karger, H.Krawczyk, T.Rabin and D.C.Toll.Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card. ESORICS 2003, Springer LNCS 2808, pp.181-200.

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

M.Di Raimondo and R.Gennaro.Provably Secure Threshold Password-Authenticated Key Exchange. EUROCRYPT 2003, Springer LNCS 2656, pp.507-523. To appear in the J. of Computer and System Sciences.

R.Gennaro and Y.Lindell. A Framework for Password-Based Authenticated Key Exchange. EUROCRYPT 2003, Springer LNCS 2656, pp.524-543.

R.Canetti, E.Kushilevitz and Y.Lindell.On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003, Springer LNCS 2656, pp.68-86.

R.Canetti, S.Halevi and J.Katz. A Forward-Secure Public-Key Encryption Scheme. EUROCRYPT 2003, Springer LNCS 2656, pp.255-271.

R.Gennaro, S.Jarecki, H.Krawczyk, T.Rabin.Secure Applications of Pedersen's Distributed Key Generation Protocol.2003 RSA Security Conference (Crypto Track), Springer LNCS 2612, pp.373-390.

2002

R.Canetti, J.Kilian, E.Petrank, and A.Rosen. Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. 32(1): 1-47 (2002).

V.Shoup and R.Gennaro. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology 15(2):75-96 (2002).

D.Catalano, R.Gennaro, N.Howgrave-Graham. Paillier's Trapdoor Function Hides up to O(n) Bits. J. Cryptology 15(4): 251-269 (2002).

W.Aiello, S.M.Bellovin, M.Blaze, J.Ioannidis, O.Reingold, R.Canetti and A.D.Keromytis. Efficient, DoS-resistant, secure key exchange for Internet protocols. 2002 ACM Conference on Computer and Communications Security: pp.48-58.

D.Coppersmith, S.Halevi and C.S.Jutla. Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002, Springer LNCS 2442, pp.515-532.

R.Gennaro, Y.Ishai, E.Kushilevitz, T.Rabin.On 2-Round Secure Multiparty Computation. CRYPTO 2002, Springer LNCS 2442, pp.178-193.

R.Canetti and H.Krawczyk.Security Analysis of IKE's Signature-Based Key-Exchange Protocol. CRYPTO 2002, Springer LNCS 2442, pp.143-161.

Y.Lindell, A.Lysyanskaya, T.Rabin. Sequential composition of protocols without simultaneous termination. PODC 2002: 203-212.

Y.Lindell, A.Lysyanskaya, and T.Rabin.On the Composition of Authenticated Byzantine Agreement.. 2002 Symposium on Theory of Computing (STOC 2002), pp.514-523.

R.Canetti, Y.Lindell, R.Ostrovsky, A.Sahai.Universally Composable Two-Party and Multi-Party Secure Computation. 2002 Symposium on Theory of Computing (STOC 2002), pp.494-503.

R.Canetti and H.Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002, Springer LNCS 2332, pp.337-351.

R.Gennaro and D.Micciancio. Cryptanalysis of a pseudorandom generator based on braid groups. EUROCRYPT 2002, Springer LNCS 2332, pp.1-13.

J.H.An, Y.Dodis and T.Rabin. On the Security of Joint Signature and Encryption. EUROCRYPT 2002, Springer LNCS 2332, pp.83-107.

S.Halevi, D.Coppersmith and C.S.Jutla. Scream: A Software-Efficient Stream Cipher. 2002 Fast Software Encryption (FSE'02), Springer LNCS 2365, pp.195-209.

A.Azagury, R.Canetti, M.Factor, S.Halevi, E.Henis, D.Naor, N.Rinetzky, D.Rodeh, J.Satran. A Two Layered Approach for Securing an Object Store Network. IEEE Security in Storage Workshop 2002: 10-23.

R.Canetti, C.Meadows, P.F.Syverson. Environmental Requirements for Authentication Protocols. 2002 International Symposyum on Software Security (ISSS'02), Springer LNCS 2609, pp.339-355.

R.Gennaro. Cryptographic Algorithms for Multimedia Traffic. 2002 Meeting on Foundations of Security Analysis and Design (FOSAD'02). SSpringer LNCS 2946, pp.186-206.

2001

R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin, Robust Threshold DSS Signatures. Information and Computation 164(1), pp.54-84, 2001.

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

R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. FOCS'01.

R.Canetti and M.Fischlin. Universally Composable Commitments.. CRYPTO 2001, Springer LNCS 2139, pp. 19-40.

H.Krawczyk. The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?). CRYPTO 2001, Springer LNCS 2139, pp.310-331.

R.Canetti, Y.Ishai, R.Kumar, M.Reiter, R.Rubinfeld and R.Wright. Selective Private Function Evaluation with Applications to Private Statistics. PODC 2001.

R.Canetti, J.Kilian, E.Petrank, and A.Rosen. Black-box concurrent zero-knowledge requires Omega~(log n) rounds. 2001 Symposium on Theory of Computing (STOC'01), pp.570-579, ACM Press.

R.Gennaro, Y.Ishai, E.Kushilevitz and T.Rabin. The round complexity of verifiable secret sharing and secure multicast. . 2001 Symposium on Theory of Computing, (STOC'01), pp.580-589.

S.Halevi, R.Krauthgamer, E.Kushilevitz, K.Nissim. Private approximation of NP-hard functions. STOC 2001: 550-559.

R.Canetti, I.Damgard, S.Dziembowsky, Y.Ishai and T.Malkin. On adaptive vs.non-adaptive security of multiparty protocols. EUROCRYPT 2001, Springer LNCS 2045, pp.262-279.

D.Catalano, R.Gennaro and N.Howgrave-Graham.Paillier's Trapdoor Function Hides up to O(n) Bits. EUROCRYPT 2001, Springer LNCS 2045, pp.229-243.

R. Canetti and H. Krawczyk. Analysis of key exchange protocols
and their use for Building Secure Channels. EUROCRYPT 2001, Springer LNCS 2045, pp.453-474.

A.Perrig, R.Canetti, D.Tygar and D.Song. Efficient and Secure Source Authentication for Multicast. 2001 Network and Distributed System Security Symposium (NDSS'01).

D.Boneh, S.Halevi and N.Howgrave-Graham. The modular inversion problem. Proceedings of ASIACRYPT 2001, pp.36-51, Springer LNCS 2248.

A.Scedrov, R.Canetti, J.D.Guttman, D.Wagner, M.Waidner. Relating Cryptography and Cryptographic Protocols. 2001 IEEE Computer Security Foundations Workshop (CSFW'01): 111-114.

E.Kushilevitz and T.Rabin. Fair e-Lotteries and e-Casinos. 2001 RSA Security Conference - Crypto Track, Springer LNCS 2020, pp.100-109.

Y.Dodis and S.Halevi.Incremental Codes. RANDOM-APPROX 2001, Springer LNCS 2129, pp.75-89.

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

N.Howgrave-Graham, J.G.Dyer, R.Gennaro. Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor. 2001 Cryptographic Hardware and Embedded Systems (CHES'01), Springer LNCS 2162, pp.93-102.

2000

R.Gennaro. A Protocol to Achieve Independence in Constant Rounds. IEEE Transactions on Parallel and Distributed Systems, 11(7):636-647, July 2000.

R.Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology 13(1):143-202, 2000.

R.Canetti, S.Halevi, and A.Herzberg. Maintaining Authenticated Communication in the Presence of Break-ins. Journal of Cryptology 13(1):61-106, Springer, 2000.

R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin. Robust and Efficient Sharing of RSA Functions. Journal of Cryptology 13(2): 273-300 (2000).

R.Gennaro, H.Krawczyk and T.Rabin. RSA-Based Undeniable Signatures. Journal of Cryptology, 13(4):397-416, 2000.

R. Canetti, E. Kushilevitz, R. Ostrovsky and A. Rosen. Randomness vs. Fault-Tolerance. Journal of Cryptology 13(1):107-142, 2000.

D.Catalano and R.Gennaro. New and Efficient Protocols for Verifiable Signature Sharing and Other Applications. Journal of Computer and System Sciences 61(1):51-80, August 2000.

J.Garay, R.Gennaro, C.Jutla and T.Rabin. Secure Distributed Storage and Retrieval. Theoretical Computer Science TCS 243(1-2): 363-389 (2000).

R.Gennaro and L.Trevisan. Lower Bounds on the Efficiency of Generic Cryptographic Constructions. FOCS'2000.

B.Barak, S.Halevi, A.Herzberg and D.Naor. Clock synchronization with faults and recoveries. PODC 2000: 133-142

Y.Dodis, S.Halevi and T.Rabin. A Cryptographic Solution to a Game Theory Problem. CRYPTO 2000, Springer LNCS 1880, pp.112-130, 2000.

R.Gennaro. An Improved Pseudo-random Generator Based on the Discrete Logarithm Problem. CRYPTO'2000, Springer LNCS 1880, pp.469-481, 2000.

R.Canetti, O.Goldreich, S.Goldwasser and S.Micali. Resettable Zero-Knowledge. STOC'2000, pp.235-244, ACM Press.

R.Canetti, Y.Dodis, S.Halevi, E.Kushilevitz and A.Sahai.Exposure-Resilient Functions and All-Or-Nothing Transforms. EUROCRYPT 2000, Springer LNCS 1807, pp.453-469, 2000.

D.Catalano, R.Gennaro and S.Halevi. Computing Inverses over a Shared Secret Modulus. EUROCRYPT'2000, Springer, LNCS 1807, pp. 445-452.

H.Krawczyk and T.Rabin. Chameleon Hashing and Signatures. 2000 Symposyum on Network and Distributed System Security Symposium (NDSS'00), Feb 2000.

A.Perrig, R.Canetti, D.Tygar and D.Song. Efficient Authentication and Signature of Multicast Streams over Lossy Channels. IEEE Symposium on Security and Privacy 2000: 56-73.

R.Canetti, P-C.Cheng, F.Giraud, D.Pendarakis, J.R.Rao, P.Rohatgi and D.Saha. IPSec-based Host Architecture for Secure Internet Multicast. 2000 Symposyum on Network and Distributed System Security Symposium (NDSS'00), Feb 2000.

H.Krawczyk. Simple forward-secure signatures from any signature scheme. 2000 ACM Conference on Computer and Communications Security: 108-115.

R.Gennaro, H.Krawczyk and T.Rabin. Undeniable Certificates. Electronic Letters, 35(20):1723-1724

1999

S.Halevi and H.Krawczyk. Public-key cryptography and password protocols. ACM Transactions on Information and System Security, vol.2, August 1999.

S.Halevi. Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver. J. Cryptology 12(2): 77-89 (1999).

A.Bar-Noy, R.Canetti, S.Kutten, Y.Mansour, B.Schieber. Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999)

R.Canetti, R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin.Adaptive Security for Threshold Cryptosystems. CRYPTO'99, Springer LNCS 1666, pp.98-115.

J.Black, S.Halevi, H.Krawczyk, T.Krovetz and P.Rogaway. UMAC: Fast and Secure Message Authentication. CRYPTO 1999, Springer LNCS 1666, pp.216-233.

M.Bellare, O.Goldreich, H.Krawczyk. Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. CRYPTO 1999, Springer LNCS 1666, pp.270-287.

R.Canetti and R.Ostrovsky. Secure computation with hidden cheaters (or, What if nobody is totally honest?). STOC 1999.

R.Cramer, I.Damgard, S.Dziembowski, M.Hirt and T.Rabin. Efficient Multiparty Computations Secure Against an Adaptive Adversary. EUROCRYPT 1999, Springer LNCS 1592, 311-326.

R.Gennaro, S.Halevi and T.Rabin. Secure Hash-and-Sign Signatures without the Random Oracle. EUROCRYPT'99, Springer LNCS 1592, pp. 123-139.

R.Canetti, T.Malkin, K.Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. EUROCRYPT 1999, Springer LNCS 1592, pp.459-474.

R.Canetti and S.Goldwasser. An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Message Attack. EUROCRYPT'99, Springer LNCS 1592, pp.90-106.

R.Gennaro, S.Jarecki, H.Krawczyk, T.Rabin.Secure Distributed Key Generation for Discrete-Log Based Cryptosystems.EUROCRYPT'99, Springer LNCS 1592, pp.295-310.

A.Gal, S.Halevi, R.J.Lipton and E.Petrank. Computing from Partial Solutions. IEEE Conference on Computational Complexity 1999: 34-45.

R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas, A taxonomy of multicast security issues and efficient constructions. INFOCOM'99.

H.Krawczyk. Blinding of Credit Card Numbers in the SET Protocol.Financial Cryptography 1999, Springer LNCS 1648, pp.17-28.

S.Battiato, D.Catalano, G.Gallo and R.Gennaro. Robust Watermarking for Images Based on Color Manipulation. Information Hiding 1999, Springer LNCS 1768, pp. 302-317.

R.Canetti, J.Friedlander and I.Shparlinski. On certain exponential sums and the distribution of Diffie-Hellman triples. J. of the London Mathematical Society, 2(59):799--812, 1999.

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

1998

P.C.Cheng, J.A.Garay, A.Herzberg, H.Krawczyk. A Security Architecture for the Internet Protocol. IBM Systems Journal 37(1): 42-60 (1998).

R.Canetti, S.Irani. Bounding the Power of Preemption in Randomized Scheduling. SIAM J. Comput. 27(4): 993-1015 (1998).

A.Ben-Dor, S.Halevi, A.Schuster. Potential Function Analysis of Greedy Hot-Potato Routing. Theory Comput. Syst. 31(1): 41-61 (1998).

S.Halevi and H.Krawczyk. Public-key cryptography and password protocols. 1998 ACM Conference on Computer and Communications Security, 1998.

R.Gennaro, D.Micciancio and T.Rabin. An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. 1998 ACM Conference on Computer and Communications Security: 67-72.

R.Gennaro, M.Rabin and T.Rabin. Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography. 1998 ACM Symposium on Principles of Distributed Computing.

T.Rabin. A Simplified Approach to Threshold and Proactive RSA. CRYPTO'98, Springer LNCS 1462, pp89-104.

D.Catalano and R.Gennaro. New and Efficient Protocols for Verifiable Signature Sharing and Other Applications. CRYPTO 1998, Springer LNCS 1462, pp.105-120.

M. Bellare, S. Halevi, A. Sahai and S. Vadhan. Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. CRYPTO '98, pages 283-298, Springer, LNCS 1462.

R.Canetti, S.Halevi and O.Goldreich. The Random-Oracle Model, Revisited. STOC'98, pp.209-218. ACM Press.

R.Canetti, D.Micciancio and O.Reingold. From Collision Resistance to Perfect One-Wayness. STOC'98, pp.131-140. ACM Press.

M.Bellare, R.Canetti and H.Krawczyk. A modular approach to the Design and Analysis of Authentication and Key Exchange Protocols. 1998 Symposyum on the Theory of Computing (STOC'98).

V.Shoup and R.Gennaro. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. EuROCRYPT'98, Springer LNCS 1403, pp.1-16.

M.Bellare, J.A.Garay and T.Rabin. Fast Batch Verification for Modular Exponentiation and Digital Signatures. EUROCRYPT 1998, Springer LNCS 1403, pp.236-250

1997

R.Cramer, R.Gennaro, B.Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme .European
Transactions on Telecommunications Vol.8 No.5, September 1997. Also EUROCRYPT'97. Springer LNCS 1233, pp.103-118.

A.Herzberg, M.Jakobsson, S.Jarecki, H.Krawczyk and M.Yung. Proactive Public Key and Signature Systems. ACM Conference on Computer and Communications Security 1997: 100-110.

R.Gennaro and P.Rohatgi. How to Sign Digital Streams. CRYPTO'97, Springer LNCS 1294, pp.180-197.

R.Gennaro, H.Krawczyk and T.Rabin. RSA-Based Undeniable Signatures. CRYPTO 1997, Springer LNCS 1294, pp.132--149.

R.Canetti. Towards realizing random oracles: Hash functions that hide all partial information. CRYPTO '97, Springer LNCS 1294, 455-470, 1997.

R.Canetti, C.Dwork, M.Naor and R.Ostrovsky. Deniable Encryption. CRYPTO 1997: Springer LNCS 1294, pp.90-104.

O.Goldreich, S.Goldwasser and S.Halevi. Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. CRYPTO 1997, Springer LNCS 1294, pp.105-111.

O.Goldreich, S.Goldwasser and S.Halevi. Public-Key Cryptosystems from Lattice Reduction Problems. CRYPTO 1997, Springer LNCS 1294, pp.112-131.

S.Halevi and H.Krawczyk. MMH: Software Message Authentication in the Gbit/Second Rates. 1997 Fast Software Encryption 1997, Springer LNCS 1267, pp.172-189.

R.Canetti, S.Halevi, and A.Herzberg. Maintaining Authenticated Communication in the Presence of Break-ins. 1997 ACM Symp. on Principles of Distributed Computation (PODC 97), ACM, 1997.

R.Canetti, E.Kushilevitz, R.Ostrovsky and A.Rosen. Randomness vs. Fault-Tolerance. PODC 1997: 35-44.

J.Garay, R.Gennaro, C.Jutla and T.Rabin. Secure Distributed Storage and Retrieval. 1997 International Workshop on Distributed Algorithms (WDAG '97), Springer LNCS 1320, pp. 275-289.

R.Canetti, R.Gennaro, A.Herzberg and D.Naor. Proactive Security: Long-term protection against break-ins.CryptoBytes RSA Laboratories Newsletter, August 1997.

1996

O.Goldreich and H.Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. Comput. 25(1): 169-192 (1996).

R.Canetti, U.Feige, O.Goldreich, M.Naor. Adaptively secure multi-party computation. STOC 1996, pages 639-648.

R.Canetti and R.Gennaro. Incoercible Multiparty Computation. FOCS 1996.

M.Bellare, R.Canetti and H.Krawczyk. Cascaded Pseudo-Randomness and its Concrete Security. FOCS 1996, pp.504-513.

M.Bellare, J.A.Garay, T.Rabin. Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. PODC 1996: 191-200.

M.Bellare, R.Canetti, H.Krawczyk. Keying Hash Functions for Message Authentication. CRYPTO 1996, Springer LNCS 1109, pp.1-15.

R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin. Robust and Efficient Sharing of RSA Functions. CRYPTO 1996, Springer LNCS 1109, pp.157-172.

R.Gennaro, S.Jarecki, H.Krawczyk and T.Rabin, Robust Threshold DSS Signatures. EUROCRYPT'96 , Springer LNCS 1070, pp.354-371.