| 2009 |
|---|
| 96 | EE | Ran Canetti,
Ronny Ramzi Dakdouk:
Towards a Theory of Extractable Functions.
TCC 2009: 595-613 |
| 95 | EE | Ran Canetti,
Mayank Varia:
Non-malleable Obfuscation.
TCC 2009: 73-90 |
| 2008 |
|---|
| 94 | | Ran Canetti:
Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008.
Springer 2008 |
| 93 | EE | Waseem Daher,
Ran Canetti:
POSH: a generalized captcha with security applications.
AISec 2008: 1-10 |
| 92 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Nancy A. Lynch,
Olivier Pereira:
Modeling Computational Security in Long-Lived Systems.
CONCUR 2008: 114-130 |
| 91 | EE | Ran Canetti,
Ronny Ramzi Dakdouk:
Obfuscating Point Functions with Multibit Output.
EUROCRYPT 2008: 489-508 |
| 90 | EE | Ran Canetti:
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency.
ICALP (2) 2008: 1-13 |
| 89 | EE | Ran Canetti,
Ronny Ramzi Dakdouk:
Extractable Perfectly One-Way Functions.
ICALP (2) 2008: 449-460 |
| 88 | EE | Ran Canetti,
Dror Eiger,
Shafi Goldwasser,
Dah-Yoh Lim:
How to Protect Yourself without Perfect Shredding.
ICALP (2) 2008: 511-523 |
| 87 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Moses Liskov,
Nancy A. Lynch,
Olivier Pereira,
Roberto Segala:
Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discrete Event Dynamic Systems 18(1): 111-159 (2008) |
| 2007 |
|---|
| 86 | EE | Ran Canetti,
Susan Hohenberger:
Chosen-ciphertext secure proxy re-encryption.
ACM Conference on Computer and Communications Security 2007: 185-194 |
| 85 | EE | Ran Canetti:
Obtaining Universally Compoable Security: Towards the Bare Bones of Trust.
ASIACRYPT 2007: 88-112 |
| 84 | EE | Ran Canetti,
Ronald L. Rivest,
Madhu Sudan,
Luca Trevisan,
Salil P. Vadhan,
Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment.
CRYPTO 2007: 264-283 |
| 83 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Nancy A. Lynch,
Olivier Pereira:
Compositional Security for Task-PIOAs.
CSF 2007: 125-139 |
| 82 | EE | Ran Canetti,
Rafael Pass,
Abhi Shelat:
Cryptography from Sunspots: How to Use an Imperfect Reference String.
FOCS 2007: 249-259 |
| 81 | EE | Ran Canetti,
Yevgeniy Dodis,
Rafael Pass,
Shabsi Walfish:
Universally Composable Security with Global Setup.
TCC 2007: 61-85 |
| 80 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme.
J. Cryptology 20(3): 265-294 (2007) |
| 79 | 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 |
|---|
| 78 | EE | Ran Canetti,
Shai Halevi,
Michael Steiner:
Mitigating Dictionary Attacks on Password-Protected Local Storage.
CRYPTO 2006: 160-179 |
| 77 | EE | Ran Canetti,
Ling Cheung,
Dilsun Kirli Kaynar,
Moses Liskov,
Nancy A. Lynch,
Olivier Pereira,
Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
DISC 2006: 238-253 |
| 76 | EE | Ran Canetti,
Jonathan Herzog:
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols.
TCC 2006: 380-403 |
| 75 | EE | Ran Canetti,
Eyal Kushilevitz,
Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.
J. Cryptology 19(2): 135-167 (2006) |
| 74 | EE | Ran Canetti:
Security and composition of cryptographic protocols: a tutorial (part I).
SIGACT News 37(3): 67-92 (2006) |
| 2005 |
|---|
| 73 | EE | Boaz Barak,
Ran Canetti,
Yehuda Lindell,
Rafael Pass,
Tal Rabin:
Secure Computation Without Authentication.
CRYPTO 2005: 361-377 |
| 72 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz,
Yehuda Lindell,
Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange.
EUROCRYPT 2005: 404-421 |
| 71 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
Adaptively-Secure, Non-interactive Public-Key Encryption.
TCC 2005: 150-168 |
| 70 | EE | Ran Canetti,
Shai Halevi,
Michael Steiner:
Hardness Amplification of Weakly Verifiable Puzzles.
TCC 2005: 17-33 |
| 69 | EE | Ran Canetti:
Decisional Diffie-Hellman Assumption.
Encyclopedia of Cryptography and Security 2005 |
| 68 | EE | Ran Canetti:
Preface.
J. Cryptology 18(3): 187-189 (2005) |
| 2004 |
|---|
| 67 | EE | Ran Canetti:
Universally Composable Signature, Certification, and Authentication.
CSFW 2004: 219- |
| 66 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption.
EUROCRYPT 2004: 207-222 |
| 65 | EE | Boaz Barak,
Ran Canetti,
Jesper Buus Nielsen,
Rafael Pass:
Universally Composable Protocols with Relaxed Set-Up Assumptions.
FOCS 2004: 186-195 |
| 64 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes.
TCC 2004: 40-57 |
| 63 | EE | William Aiello,
Steven M. Bellovin,
Matt Blaze,
Ran Canetti,
John Ioannidis,
Angelos D. Keromytis,
Omer Reingold:
Just fast keying: Key agreement in a hostile internet.
ACM Trans. Inf. Syst. Secur. 7(2): 242-273 (2004) |
| 62 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The random oracle methodology, revisited.
J. ACM 51(4): 557-594 (2004) |
| 61 | EE | Ran Canetti,
Ivan Damgård,
Stefan Dziembowski,
Yuval Ishai,
Tal Malkin:
Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
J. Cryptology 17(3): 153-207 (2004) |
| 2003 |
|---|
| 60 | EE | Ran Canetti,
Tal Rabin:
Universal Composition with Joint State.
CRYPTO 2003: 265-281 |
| 59 | EE | Ran Canetti,
Hugo Krawczyk,
Jesper Buus Nielsen:
Relaxing Chosen-Ciphertext Security.
CRYPTO 2003: 565-582 |
| 58 | EE | Helmut Scherzer,
Ran Canetti,
Paul A. Karger,
Hugo Krawczyk,
Tal Rabin,
David C. Toll:
Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card.
ESORICS 2003: 181-200 |
| 57 | EE | Ran Canetti,
Shai Halevi,
Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme.
EUROCRYPT 2003: 255-271 |
| 56 | EE | Ran Canetti,
Eyal Kushilevitz,
Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.
EUROCRYPT 2003: 68-86 |
| 2002 |
|---|
| 55 | EE | William Aiello,
Steven M. Bellovin,
Matt Blaze,
John Ioannidis,
Omer Reingold,
Ran Canetti,
Angelos D. Keromytis:
Efficient, DoS-resistant, secure key exchange for internet protocols.
ACM Conference on Computer and Communications Security 2002: 48-58 |
| 54 | EE | Ran Canetti,
Hugo Krawczyk:
Security Analysis of IKE's Signature-Based Key-Exchange Protocol.
CRYPTO 2002: 143-161 |
| 53 | EE | Ran Canetti,
Hugo Krawczyk:
Universally Composable Notions of Key Exchange and Secure Channels.
EUROCRYPT 2002: 337-351 |
| 52 | 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 |
| 51 | EE | Ran Canetti,
Catherine Meadows,
Paul F. Syverson:
Environmental Requirements for Authentication Protocols.
ISSS 2002: 339-355 |
| 50 | EE | Ran Canetti,
Yehuda Lindell,
Rafail Ostrovsky,
Amit Sahai:
Universally composable two-party and multi-party secure computation.
STOC 2002: 494-503 |
| 49 | EE | Ran Canetti,
Joe Kilian,
Erez Petrank,
Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM J. Comput. 32(1): 1-47 (2002) |
| 2001 |
|---|
| 48 | EE | Ran Canetti,
Marc Fischlin:
Universally Composable Commitments.
CRYPTO 2001: 19-40 |
| 47 | EE | Andre Scedrov,
Ran Canetti,
Joshua D. Guttman,
David Wagner,
Michael Waidner:
Relating Cryptography and Cryptographic Protocols.
CSFW 2001: 111-114 |
| 46 | EE | Ran Canetti,
Ivan Damgård,
Stefan Dziembowski,
Yuval Ishai,
Tal Malkin:
On Adaptive vs. Non-adaptive Security of Multiparty Protocols.
EUROCRYPT 2001: 262-279 |
| 45 | EE | Ran Canetti,
Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.
EUROCRYPT 2001: 453-474 |
| 44 | | Ran Canetti:
Universally Composable Security: A New Paradigm for Cryptographic Protocols.
FOCS 2001: 136-145 |
| 43 | EE | Adrian Perrig,
Ran Canetti,
Dawn Xiaodong Song,
J. D. Tygar:
Efficient and Secure Source Authentication for Multicast.
NDSS 2001 |
| 42 | EE | Ran Canetti,
Yuval Ishai,
Ravi Kumar,
Michael K. Reiter,
Ronitt Rubinfeld,
Rebecca N. Wright:
Selective private function evaluation with applications to private statistics.
PODC 2001: 293-304 |
| 41 | EE | Ran Canetti,
Joe Kilian,
Erez Petrank,
Alon Rosen:
Black-box concurrent zero-knowledge requires Omega~(log n) rounds.
STOC 2001: 570-579 |
| 40 | EE | William Aiello,
Steven M. Bellovin,
Matt Blaze,
Ran Canetti,
John Ioannidis,
Angelos D. Keromytis,
Omer Reingold:
Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols.
Security Protocols Workshop 2001: 27-39 |
| 39 | EE | Ran Canetti:
A unified framework for analyzing security of protocols
Electronic Colloquium on Computational Complexity (ECCC) 8(16): (2001) |
| 38 | EE | Ran Canetti,
Joe Kilian,
Erez Petrank,
Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds
Electronic Colloquium on Computational Complexity (ECCC) 8(50): (2001) |
| 2000 |
|---|
| 37 | EE | Ran Canetti,
Yevgeniy Dodis,
Shai Halevi,
Eyal Kushilevitz,
Amit Sahai:
Exposure-Resilient Functions and All-or-Nothing Transforms.
EUROCRYPT 2000: 453-469 |
| 36 | EE | Adrian Perrig,
Ran Canetti,
J. D. Tygar,
Dawn Xiaodong Song:
Efficient Authentication and Signing of Multicast Streams over Lossy Channels.
IEEE Symposium on Security and Privacy 2000: 56-73 |
| 35 | EE | Ran Canetti,
Pau-Chen Cheng,
Frederique Giraud,
Dimitrios E. Pendarakis,
Josyula R. Rao,
Pankaj Rohatgi,
Debanjan Saha:
An IPSec-based Host Architecture for Secure Internet Multicast.
NDSS 2000 |
| 34 | EE | Ran Canetti,
Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
Resettable zero-knowledge (extended abstract).
STOC 2000: 235-244 |
| 33 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The Random Oracle Methodology, Revisited
CoRR cs.CR/0010019: (2000) |
| 32 | EE | Ran Canetti,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Randomness versus Fault-Tolerance.
J. Cryptology 13(1): 107-142 (2000) |
| 31 | EE | Ran Canetti:
Security and Composition of Multiparty Cryptographic Protocols.
J. Cryptology 13(1): 143-202 (2000) |
| 30 | EE | Ran Canetti,
Shai Halevi,
Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-Ins.
J. Cryptology 13(1): 61-105 (2000) |
| 1999 |
|---|
| 29 | EE | Ran Canetti,
Rosario Gennaro,
Stanislaw Jarecki,
Hugo Krawczyk,
Tal Rabin:
Adaptive Security for Threshold Cryptosystems.
CRYPTO 1999: 98-115 |
| 28 | EE | Ran Canetti,
Tal Malkin,
Kobbi Nissim:
Efficient Communication-Storage Tradeoffs for Multicast Encryption.
EUROCRYPT 1999: 459-474 |
| 27 | EE | Ran Canetti,
Shafi Goldwasser:
An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack.
EUROCRYPT 1999: 90-106 |
| 26 | | Ran Canetti,
Juan A. Garay,
Gene Itkis,
Daniele Micciancio,
Moni Naor,
Benny Pinkas:
Multicast Security: A Taxonomy and Some Efficient Constructions.
INFOCOM 1999: 708-716 |
| 25 | EE | Ran Canetti,
Rafail Ostrovsky:
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract).
STOC 1999: 255-264 |
| 24 | EE | Ran Canetti,
Oded Goldreich,
Shafi Goldwasser,
Silvio Micali:
Resettable Zero-Knowledge.
Electronic Colloquium on Computational Complexity (ECCC)(42): (1999) |
| 23 | | Amotz Bar-Noy,
Ran Canetti,
Shay Kutten,
Yishay Mansour,
Baruch Schieber:
Bandwidth Allocation with Preemption.
SIAM J. Comput. 28(5): 1806-1828 (1999) |
| 1998 |
|---|
| 22 | EE | Ran Canetti,
Daniele Micciancio,
Omer Reingold:
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).
STOC 1998: 131-140 |
| 21 | EE | Ran Canetti,
Oded Goldreich,
Shai Halevi:
The Random Oracle Methodology, Revisited (Preliminary Version).
STOC 1998: 209-218 |
| 20 | EE | Mihir Bellare,
Ran Canetti,
Hugo Krawczyk:
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract).
STOC 1998: 419-428 |
| 19 | EE | Ran Canetti,
Sandy Irani:
Bounding the Power of Preemption in Randomized Scheduling.
SIAM J. Comput. 27(4): 993-1015 (1998) |
| 1997 |
|---|
| 18 | EE | Ran Canetti:
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information.
CRYPTO 1997: 455-469 |
| 17 | EE | Ran Canetti,
Cynthia Dwork,
Moni Naor,
Rafail Ostrovsky:
Deniable Encryption.
CRYPTO 1997: 90-104 |
| 16 | | Ran Canetti,
Shai Halevi,
Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins.
PODC 1997: 15-24 |
| 15 | | Ran Canetti,
Eyal Kushilevitz,
Rafail Ostrovsky,
Adi Rosén:
Randomness vs. Fault-Tolerance.
PODC 1997: 35-44 |
| 1996 |
|---|
| 14 | EE | Mihir Bellare,
Ran Canetti,
Hugo Krawczyk:
Keying Hash Functions for Message Authentication.
CRYPTO 1996: 1-15 |
| 13 | | Ran Canetti,
Rosario Gennaro:
Incoercible Multiparty Computation (extended abstract).
FOCS 1996: 504-513 |
| 12 | | Mihir Bellare,
Ran Canetti,
Hugo Krawczyk:
Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security.
FOCS 1996: 514-523 |
| 11 | EE | Ran Canetti,
Uriel Feige,
Oded Goldreich,
Moni Naor:
Adaptively Secure Multi-Party Computation.
STOC 1996: 639-648 |
| 10 | EE | Ran Canetti:
More on BPP and the Polynomial-Time Hierarchy.
Inf. Process. Lett. 57(5): 237-241 (1996) |
| 1995 |
|---|
| 9 | EE | Ran Canetti,
Sandy Irani:
Bounding the power of preemption in randomized scheduling.
STOC 1995: 606-615 |
| 8 | EE | Amotz Bar-Noy,
Ran Canetti,
Shay Kutten,
Yishay Mansour,
Baruch Schieber:
Bandwidth allocation with preemption.
STOC 1995: 616-625 |
| 7 | EE | Ran Canetti,
Guy Even,
Oded Goldreich:
Lower Bounds for Sampling Algorithms for Estimating the Average.
Inf. Process. Lett. 53(1): 17-25 (1995) |
| 1994 |
|---|
| 6 | EE | Ran Canetti,
Amir Herzberg:
Maintaining Security in the Presence of Transient Faults.
CRYPTO 1994: 425-438 |
| 1993 |
|---|
| 5 | EE | Ran Canetti,
Tal Rabin:
Fast asynchronous Byzantine agreement with optimal resilience.
STOC 1993: 42-51 |
| 4 | EE | Michael Ben-Or,
Ran Canetti,
Oded Goldreich:
Asynchronous secure computation.
STOC 1993: 52-61 |
| 3 | | Ran Canetti,
Oded Goldreich:
Bounds on Tradeoffs Between Randomness and Communication Complexity.
Computational Complexity 3: 141-167 (1993) |
| 1991 |
|---|
| 2 | | Ran Canetti,
L. Paul Fertig,
Saul A. Kravitz,
Dalia Malki,
Ron Y. Pinter,
Sara Porat,
Avi Teperman:
The parallel C (pC) programming language.
IBM Journal of Research and Development 35(5): 727-742 (1991) |
| 1990 |
|---|
| 1 | | Ran Canetti,
Oded Goldreich:
Bounds on Tradeoffs between Randomness and Communication Complexity
FOCS 1990: 766-775 |
