| * | 2009 |
| 63 | EE | Shai Halevi:
Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings
Springer 2009 |
| 62 | EE | Craig Gentry,
Shai Halevi:
Hierarchical Identity Based Encryption with Polynomially Many Levels.
TCC 2009: 437-456 |
| 61 | EE | Tzipora Halevi,
Nitesh Saxena,
Shai Halevi:
Using HB Family of Protocols for Privacy-Preserving Authentication of RFID Tags in a Population
CoRR abs/0907.1227: (2009) |
| 2008 |
| 60 | EE | Dan Boneh,
Shai Halevi,
Michael Hamburg,
Rafail Ostrovsky:
Circular-Secure Encryption from Decision Diffie-Hellman.
CRYPTO 2008: 108-125 |
| 59 | EE | Rosario Gennaro,
Shai Halevi,
Hugo Krawczyk,
Tal Rabin,
Steffen Reidt,
Stephen D. Wolthusen:
Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs.
ESORICS 2008: 49-65 |
| 58 | EE | Rosario Gennaro,
Shai Halevi,
Hugo Krawczyk,
Tal Rabin:
Threshold RSA for Dynamic and Ad-Hoc Groups.
EUROCRYPT 2008: 88-107 |
| 57 | EE | Shai Halevi:
Storage Encryption: A Cryptographer's View.
SCN 2008: 1 |
| 56 | EE | Sharon Goldberg,
Shai Halevi,
Aaron D. Jaggard,
Vijay Ramachandran,
Rebecca N. Wright:
Rationality and traffic attraction: incentives for honest path announcements in bgp.
SIGCOMM 2008: 267-278 |
| 55 | EE | Shai Halevi,
Steven Myers,
Charles Rackoff:
On Seed-Incompressible Functions.
TCC 2008: 19-36 |
| 54 | EE | Shai Halevi,
Tal Rabin:
Degradation and Amplification of Computational Hardness.
TCC 2008: 626-643 |
| 53 | EE | Don Coppersmith,
Jean-Sébastien Coron,
François Grieu,
Shai Halevi,
Charanjit S. Jutla,
David Naccache,
Julien P. Stern:
Cryptanalysis of ISO/IEC 9796-1.
J. Cryptology 21(1): 27-51 (2008) |
| 2007 |
| 52 | EE | Shai Halevi,
Hugo Krawczyk:
Security under key-dependent inputs.
ACM Conference on Computer and Communications Security 2007: 466-475 |
| 51 | EE | Shai Halevi:
Invertible Universal Hashing and the TET Encryption Mode.
CRYPTO 2007: 412-429 |
| 50 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme.
J. Cryptology 20(3): 265-294 (2007) |
| 49 | EE | Dan Boneh,
Ran Canetti,
Shai Halevi,
Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption.
SIAM J. Comput. 36(5): 1301-1328 (2007) |
| 2006 |
| 48 | | Shai Halevi,
Tal Rabin:
Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings
Springer 2006 |
| 47 | EE | Ran Canetti,
Shai Halevi,
Michael Steiner:
Mitigating Dictionary Attacks on Password-Protected Local Storage.
CRYPTO 2006: 160-179 |
| 46 | EE | Shai Halevi,
Hugo Krawczyk:
Strengthening Digital Signatures Via Randomized Hashing.
CRYPTO 2006: 41-59 |
| 45 | EE | Dan Boneh,
Xavier Boyen,
Shai Halevi:
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles.
CT-RSA 2006: 226-243 |
| 2005 |
| 44 | EE | Boaz Barak,
Shai Halevi:
A model and architecture for pseudo-random generation with applications to /dev/random.
ACM Conference on Computer and Communications Security 2005: 203-212 |
| 43 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz,
Yehuda Lindell,
Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange.
EUROCRYPT 2005: 404-421 |
| 42 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
Adaptively-Secure, Non-interactive Public-Key Encryption.
TCC 2005: 150-168 |
| 41 | EE | Ran Canetti,
Shai Halevi,
Michael Steiner:
Hardness Amplification of Weakly Verifiable Puzzles.
TCC 2005: 17-33 |
| 2004 |
| 40 | EE | Shai Halevi,
Phillip Rogaway:
A Parallelizable Enciphering Mode.
CT-RSA 2004: 292-304 |
| 39 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption.
EUROCRYPT 2004: 207-222 |
| 38 | EE | Shai Halevi:
EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data.
INDOCRYPT 2004: 315-327 |
| 37 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes.
TCC 2004: 40-57 |
| 36 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The random oracle methodology, revisited.
J. ACM 51(4): 557-594 (2004) |
| 2003 |
| 35 | EE | Shai Halevi,
Phillip Rogaway:
A Tweakable Enciphering Mode.
CRYPTO 2003: 482-499 |
| 34 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme.
EUROCRYPT 2003: 255-271 |
| 2002 |
| 33 | EE | Don Coppersmith,
Shai Halevi,
Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking.
CRYPTO 2002: 515-532 |
| 32 | EE | Shai Halevi,
Don Coppersmith,
Charanjit S. Jutla:
Scream: A Software-Efficient Stream Cipher.
FSE 2002: 195-209 |
| 31 | EE | Alain Azagury,
Ran Canetti,
Michael Factor,
Shai Halevi,
Ealan Henis,
Dalit Naor,
Noam Rinetzky,
Ohad Rodeh,
Julian Satran:
A Two Layered Approach for Securing an Object Store Network.
IEEE Security in Storage Workshop 2002: 10-23 |
| 2001 |
| 30 | EE | Dan Boneh,
Shai Halevi,
Nick Howgrave-Graham:
The Modular Inversion Hidden Number Problem.
ASIACRYPT 2001: 36-51 |
| 29 | EE | Yevgeniy Dodis,
Shai Halevi:
Incremental Codes.
RANDOM-APPROX 2001: 75-89 |
| 28 | EE | Shai Halevi,
Robert Krauthgamer,
Eyal Kushilevitz,
Kobbi Nissim:
Private approximation of NP-hard functions.
STOC 2001: 550-559 |
| 2000 |
| 27 | | Don Coppersmith,
Rosario Gennaro,
Shai Halevi,
Charanjit S. Jutla,
Stephen M. Matyas,
Mohammad Peyravian,
David Safford,
Nevenko Zunic:
IBM Comments.
AES Candidate Conference 2000: 333-336 |
| 26 | EE | Yevgeniy Dodis,
Shai Halevi,
Tal Rabin:
A Cryptographic Solution to a Game Theoretic Problem.
CRYPTO 2000: 112-130 |
| 25 | EE | Dario Catalano,
Rosario Gennaro,
Shai Halevi:
Computing Inverses over a Shared Secret Modulus.
EUROCRYPT 2000: 190-206 |
| 24 | EE | Ran Canetti,
Yevgeniy Dodis,
Shai Halevi,
Eyal Kushilevitz,
Amit Sahai:
Exposure-Resilient Functions and All-or-Nothing Transforms.
EUROCRYPT 2000: 453-469 |
| 23 | EE | Boaz Barak,
Shai Halevi,
Amir Herzberg,
Dalit Naor:
Clock synchronization with faults and recoveries (extended abstract).
PODC 2000: 133-142 |
| 22 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The Random Oracle Methodology, Revisited
CoRR cs.CR/0010019: (2000) |
| 21 | EE | Ran Canetti,
Shai Halevi,
Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-Ins.
J. Cryptology 13(1): 61-105 (2000) |
| 1999 |
| 20 | EE | John Black,
Shai Halevi,
Hugo Krawczyk,
Ted Krovetz,
Phillip Rogaway:
UMAC: Fast and Secure Message Authentication.
CRYPTO 1999: 216-233 |
| 19 | EE | Rosario Gennaro,
Shai Halevi,
Tal Rabin:
Secure Hash-and-Sign Signatures Without the Random Oracle.
EUROCRYPT 1999: 123-139 |
| 18 | EE | Anna Gál,
Shai Halevi,
Richard J. Lipton,
Erez Petrank:
Computing from Partial Solutions.
IEEE Conference on Computational Complexity 1999: 34-45 |
| 17 | EE | Shai Halevi,
Hugo Krawczyk:
Public-Key Cryptography and Password Protocols.
ACM Trans. Inf. Syst. Secur. 2(3): 230-268 (1999) |
| 16 | EE | Shai Halevi:
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver.
J. Cryptology 12(2): 77-89 (1999) |
| 1998 |
| 15 | EE | Shai Halevi,
Hugo Krawczyk:
Public-Key Cryptography and Password Protocols.
ACM Conference on Computer and Communications Security 1998: 122-131 |
| 14 | EE | Mihir Bellare,
Shai Halevi,
Amit Sahai,
Salil P. Vadhan:
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems.
CRYPTO 1998: 283-298 |
| 13 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The Random Oracle Methodology, Revisited (Preliminary Version).
STOC 1998: 209-218 |
| 12 | | Amir Ben-Dor,
Shai Halevi,
Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
Theory Comput. Syst. 31(1): 41-61 (1998) |
| 1997 |
| 11 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem.
CRYPTO 1997: 105-111 |
| 10 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Public-Key Cryptosystems from Lattice Reduction Problems.
CRYPTO 1997: 112-131 |
| 9 | EE | Shai Halevi,
Hugo Krawczyk:
MMH: Software Message Authentication in the Gbit/Second Rates.
FSE 1997: 172-189 |
| 8 | | Ran Canetti,
Shai Halevi,
Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins.
PODC 1997: 15-24 |
| 7 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem.
Electronic Colloquium on Computational Complexity (ECCC) 4(18): (1997) |
| 1996 |
| 6 | EE | Shai Halevi,
Silvio Micali:
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing.
CRYPTO 1996: 201-215 |
| 5 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Collision-Free Hashing from Lattice Problems
Electronic Colloquium on Computational Complexity (ECCC) 3(42): (1996) |
| 4 | EE | Oded Goldreich,
Shafi Goldwasser,
Shai Halevi:
Public-Key Cryptosystems from Lattice Reduction Problems
Electronic Colloquium on Computational Complexity (ECCC) 3(56): (1996) |
| 1995 |
| 3 | EE | Shai Halevi:
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver.
CRYPTO 1995: 84-96 |
| 1994 |
| 2 | | Amir Ben-Dor,
Shai Halevi,
Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
PODC 1994: 225-234 |
| 1993 |
| 1 | | Amir Ben-Dor,
Shai Halevi:
Zero-One Permanent is #P-Complete, A Simpler Proof.
ISTCS 1993: 108-117 |