![]() | ![]() |
| 2012 | ||
|---|---|---|
| 152 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. ITCS 2012: 326-349 | |
| 151 | Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee: Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466 | |
| 150 | Nir Bitansky, Ran Canetti, Shai Halevi: Leakage-Tolerant Interactive Protocols. TCC 2012: 266-284 | |
| 149 | Ran Canetti, Margarita Vald: Universally Composable Security With Local Adversaries. IACR Cryptology ePrint Archive 2012: 117 (2012) | |
| 148 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptology ePrint Archive 2012: 95 (2012) | |
| 2011 | ||
| 147 | Ran Canetti, Ben Riva, Guy N. Rothblum: Practical delegation of computation using multiple servers. ACM Conference on Computer and Communications Security 2011: 445-454 | |
| 146 | Ran Canetti, Suresh Chari, Shai Halevi, Birgit Pfitzmann, Arnab Roy, Michael Steiner, Wietse Venema: Composable Security Analysis of OS Services. ACNS 2011: 431-448 | |
| 145 | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 | |
| 144 | Gilad Asharov, Ran Canetti, Carmit Hazay: Towards a Game Theoretic View of Secure Computation. EUROCRYPT 2011: 426-445 | |
| 143 | Ran Canetti, Mayank Varia: Decisional Diffie-Hellman Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 316-319 | |
| 142 | Gilad Asharov, Ran Canetti, Carmit Hazay: Towards a Game Theoretic View of Secure Computation. IACR Cryptology ePrint Archive 2011: 137 (2011) | |
| 141 | Nir Bitansky, Ran Canetti, Shai Halevi: Leakage Tolerant Interactive Protocols. IACR Cryptology ePrint Archive 2011: 204 (2011) | |
| 140 | Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer: From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptology ePrint Archive 2011: 443 (2011) | |
| 139 | Ran Canetti, Ben Riva, Guy N. Rothblum: Two 1-Round Protocols for Delegation of Computation. IACR Cryptology ePrint Archive 2011: 518 (2011) | |
| 138 | Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum: Program Obfuscation with Leaky Hardware. IACR Cryptology ePrint Archive 2011: 660 (2011) | |
| 137 | Ran Canetti, Jonathan Herzog: Universally Composable Symbolic Security Analysis. J. Cryptology 24(1): 83-147 (2011) | |
| 136 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. J. Cryptology 24(4): 720-760 (2011) | |
| 2010 | ||
| 135 | Nir Bitansky, Ran Canetti: On Strong Simulation and Composable Point Obfuscation. CRYPTO 2010: 520-537 | |
| 134 | Ran Canetti, Huijia Lin, Rafael Pass: Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. FOCS 2010: 541-550 | |
| 133 | Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs: On Symmetric Encryption and Point Obfuscation. TCC 2010: 52-71 | |
| 132 | Ran Canetti, Guy N. Rothblum, Mayank Varia: Obfuscation of Hyperplane Membership. TCC 2010: 72-89 | |
| 131 | Ran Canetti, Suresh Chari, Shai Halevi, Birgit Pfitzmann, Arnab Roy, Michael Steiner, Wietse Venema: Composable Security Analysis of OS Services. IACR Cryptology ePrint Archive 2010: 213 (2010) | |
| 130 | Ran Canetti, Sebastian Gajek: Universally Composable Symbolic Analysis of Diffie-Hellman based Key Exchange. IACR Cryptology ePrint Archive 2010: 303 (2010) | |
| 129 | Nir Bitansky, Ran Canetti: On Strong Simulation and Composable Point Obfuscation. IACR Cryptology ePrint Archive 2010: 414 (2010) | |
| 128 | Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs: On Symmetric Encryption and Point Obfuscation. IACR Cryptology ePrint Archive 2010: 49 (2010) | |
| 2009 | ||
| 127 | Ran Canetti, Ronny Ramzi Dakdouk: Towards a Theory of Extractable Functions. TCC 2009: 595-613 | |
| 126 | Ran Canetti, Mayank Varia: Non-malleable Obfuscation. TCC 2009: 73-90 | |
| 2008 | ||
| 125 | Ran Canetti: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Springer 2008 | |
| 124 | Waseem Daher, Ran Canetti: POSH: a generalized captcha with security applications. AISec 2008: 1-10 | |
| 123 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems. CONCUR 2008: 114-130 | |
| 122 | Ran Canetti, Ronny Ramzi Dakdouk: Obfuscating Point Functions with Multibit Output. EUROCRYPT 2008: 489-508 | |
| 121 | Ran Canetti: Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency. ICALP (2) 2008: 1-13 | |
| 120 | Ran Canetti, Ronny Ramzi Dakdouk: Extractable Perfectly One-Way Functions. ICALP (2) 2008: 449-460 | |
| 119 | Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim: How to Protect Yourself without Perfect Shredding. ICALP (2) 2008: 511-523 | |
| 118 | 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) | |
| 117 | Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim: How to Protect Yourself without Perfect Shredding. IACR Cryptology ePrint Archive 2008: 291 (2008) | |
| 116 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems, Version 2. IACR Cryptology ePrint Archive 2008: 492 (2008) | |
| 115 | Ran Canetti, Mayank Varia: Non-Malleable Obfuscation. IACR Cryptology ePrint Archive 2008: 495 (2008) | |
| 2007 | ||
| 114 | Ran Canetti, Susan Hohenberger: Chosen-ciphertext secure proxy re-encryption. ACM Conference on Computer and Communications Security 2007: 185-194 | |
| 113 | Ran Canetti: Obtaining Universally Compoable Security: Towards the Bare Bones of Trust. ASIACRYPT 2007: 88-112 | |
| 112 | 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 | |
| 111 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Compositional Security for Task-PIOAs. CSF 2007: 125-139 | |
| 110 | Ran Canetti, Rafael Pass, Abhi Shelat: Cryptography from Sunspots: How to Use an Imperfect Reference String. FOCS 2007: 249-259 | |
| 109 | Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish: Universally Composable Security with Global Setup. TCC 2007: 61-85 | |
| 108 | Ran Canetti, Ling Cheung, Nancy A. Lynch, Olivier Pereira: On the Role of Scheduling in Simulation-Based Security. IACR Cryptology ePrint Archive 2007: 102 (2007) | |
| 107 | Ran Canetti, Susan Hohenberger: Chosen-Ciphertext Secure Proxy Re-Encryption. IACR Cryptology ePrint Archive 2007: 171 (2007) | |
| 106 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira: Modeling Computational Security in Long-Lived Systems. IACR Cryptology ePrint Archive 2007: 406 (2007) | |
| 105 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. IACR Cryptology ePrint Archive 2007: 464 (2007) | |
| 104 | Ran Canetti: Obtaining Universally Composable Security: Towards the Bare Bones of Trust. IACR Cryptology ePrint Archive 2007: 475 (2007) | |
| 103 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. J. Cryptology 20(3): 265-294 (2007) | |
| 102 | Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. SIAM J. Comput. 36(5): 1301-1328 (2007) | |
| 2006 | ||
| 101 | Ran Canetti, Shai Halevi, Michael Steiner: Mitigating Dictionary Attacks on Password-Protected Local Storage. CRYPTO 2006: 160-179 | |
| 100 | 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 | |
| 99 | Ran Canetti, Jonathan Herzog: Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. TCC 2006: 380-403 | |
| 98 | Ran Canetti, Shai Halevi, Michael Steiner: Mitigating Dictionary Attacks on Password-Protected Local Storage. IACR Cryptology ePrint Archive 2006: 276 (2006) | |
| 97 | Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish: Universally Composable Security with Global Setup. IACR Cryptology ePrint Archive 2006: 432 (2006) | |
| 96 | Ran Canetti: Security and Composition of Cryptographic Protocols: A Tutorial. IACR Cryptology ePrint Archive 2006: 465 (2006) | |
| 95 | 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) | |
| 94 | Ran Canetti: Security and composition of cryptographic protocols: a tutorial (part I). SIGACT News 37(3): 67-92 (2006) | |
| 2005 | ||
| 93 | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. CRYPTO 2005: 361-377 | |
| 92 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 | |
| 91 | Ran Canetti, Shai Halevi, Jonathan Katz: Adaptively-Secure, Non-interactive Public-Key Encryption. TCC 2005: 150-168 | |
| 90 | Ran Canetti, Shai Halevi, Michael Steiner: Hardness Amplification of Weakly Verifiable Puzzles. TCC 2005: 17-33 | |
| 89 | Ran Canetti: Decisional Diffie-Hellman Assumption. Encyclopedia of Cryptography and Security 2005 | |
| 88 | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. IACR Cryptology ePrint Archive 2005: 196 (2005) | |
| 87 | Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala: Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. IACR Cryptology ePrint Archive 2005: 452 (2005) | |
| 86 | Ran Canetti: Preface. J. Cryptology 18(3): 187-189 (2005) | |
| 2004 | ||
| 85 | Ran Canetti: Universally Composable Signature, Certification, and Authentication. CSFW 2004: 219- | |
| 84 | Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. EUROCRYPT 2004: 207-222 | |
| 83 | Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 | |
| 82 | Ran Canetti, Oded Goldreich, Shai Halevi: On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. TCC 2004: 40-57 | |
| 81 | 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) | |
| 80 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptology ePrint Archive 2004: 116 (2004) | |
| 79 | Ran Canetti, Shai Halevi, Jonathan Katz: Adaptively-Secure, Non-Interactive Public-Key Encryption. IACR Cryptology ePrint Archive 2004: 317 (2004) | |
| 78 | Ran Canetti, Shai Halevi, Michael Steiner: Hardness amplification of weakly verifiable puzzles. IACR Cryptology ePrint Archive 2004: 329 (2004) | |
| 77 | Ran Canetti, Jonathan Herzog: Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange). IACR Cryptology ePrint Archive 2004: 334 (2004) | |
| 76 | Ran Canetti, Oded Goldreich, Shai Halevi: The random oracle methodology, revisited. J. ACM 51(4): 557-594 (2004) | |
| 75 | 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 | ||
| 74 | Ran Canetti, Tal Rabin: Universal Composition with Joint State. CRYPTO 2003: 265-281 | |
| 73 | Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. CRYPTO 2003: 565-582 | |
| 72 | 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 | |
| 71 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. EUROCRYPT 2003: 255-271 | |
| 70 | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86 | |
| 69 | Ran Canetti, Oded Goldreich, Shai Halevi: On the random-oracle methodology as applied to length-restricted signature schemes. IACR Cryptology ePrint Archive 2003: 150 (2003) | |
| 68 | Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. IACR Cryptology ePrint Archive 2003: 174 (2003) | |
| 67 | Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. IACR Cryptology ePrint Archive 2003: 182 (2003) | |
| 66 | Ran Canetti: Universally Composable Signatures, Certification and Authentication. IACR Cryptology ePrint Archive 2003: 239 (2003) | |
| 65 | Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme. IACR Cryptology ePrint Archive 2003: 83 (2003) | |
| 2002 | ||
| 64 | 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 | |
| 63 | Ran Canetti, Hugo Krawczyk: Security Analysis of IKE's Signature-Based Key-Exchange Protocol. CRYPTO 2002: 143-161 | |
| 62 | Ran Canetti, Hugo Krawczyk: Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002: 337-351 | |
| 61 | 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 | |
| 60 | Ran Canetti, Catherine Meadows, Paul F. Syverson: Environmental Requirements for Authentication Protocols. ISSS 2002: 339-355 | |
| 59 | Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai: Universally composable two-party and multi-party secure computation. STOC 2002: 494-503 | |
| 58 | Ran Canetti, Hugo Krawczyk: Security Analysis of IKE's Signature-based Key-Exchange Protocol. IACR Cryptology ePrint Archive 2002: 120 (2002) | |
| 57 | Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai: Universally Composable Two-Party and Multi-Party Secure Computation. IACR Cryptology ePrint Archive 2002: 140 (2002) | |
| 56 | Ran Canetti, Tal Rabin: Universal Composition with Joint State. IACR Cryptology ePrint Archive 2002: 47 (2002) | |
| 55 | Ran Canetti, Hugo Krawczyk: Universally Composable Notions of Key Exchange and Secure Channels. IACR Cryptology ePrint Archive 2002: 59 (2002) | |
| 54 | 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 | ||
| 53 | Ran Canetti, Marc Fischlin: Universally Composable Commitments. CRYPTO 2001: 19-40 | |
| 52 | Andre Scedrov, Ran Canetti, Joshua D. Guttman, David Wagner, Michael Waidner: Relating Cryptography and Cryptographic Protocols. CSFW 2001: 111-114 | |
| 51 | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279 | |
| 50 | Ran Canetti, Hugo Krawczyk: Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. EUROCRYPT 2001: 453-474 | |
| 49 | Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145 | |
| 48 | Adrian Perrig, Ran Canetti, Dawn Xiaodong Song, J. D. Tygar: Efficient and Secure Source Authentication for Multicast. NDSS 2001 | |
| 47 | 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 | |
| 46 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579 | |
| 45 | 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 | |
| 44 | Ran Canetti: A unified framework for analyzing security of protocols Electronic Colloquium on Computational Complexity (ECCC) 8(16): (2001) | |
| 43 | 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) | |
| 42 | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On adaptive vs. non-adaptive security of multiparty protocols. IACR Cryptology ePrint Archive 2001: 17 (2001) | |
| 41 | Ran Canetti, Hugo Krawczyk: Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. IACR Cryptology ePrint Archive 2001: 40 (2001) | |
| 40 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptology ePrint Archive 2001: 51 (2001) | |
| 39 | Ran Canetti, Marc Fischlin: Universally Composable Commitments. IACR Cryptology ePrint Archive 2001: 55 (2001) | |
| 2000 | ||
| 38 | Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai: Exposure-Resilient Functions and All-or-Nothing Transforms. EUROCRYPT 2000: 453-469 | |
| 37 | 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 | |
| 36 | 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 | |
| 35 | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 | |
| 34 | Ran Canetti, Oded Goldreich, Shai Halevi: The Random Oracle Methodology, Revisited CoRR cs.CR/0010019: (2000) | |
| 33 | Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. IACR Cryptology ePrint Archive 2000: 67 (2000) | |
| 32 | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Randomness versus Fault-Tolerance. J. Cryptology 13(1): 107-142 (2000) | |
| 31 | Ran Canetti: Security and Composition of Multiparty Cryptographic Protocols. J. Cryptology 13(1): 143-202 (2000) | |
| 30 | Ran Canetti, Shai Halevi, Amir Herzberg: Maintaining Authenticated Communication in the Presence of Break-Ins. J. Cryptology 13(1): 61-105 (2000) | |
| 1999 | ||
| 29 | Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Adaptive Security for Threshold Cryptosystems. CRYPTO 1999: 98-115 | |
| 28 | Ran Canetti, Tal Malkin, Kobbi Nissim: Efficient Communication-Storage Tradeoffs for Multicast Encryption. EUROCRYPT 1999: 459-474 | |
| 27 | 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 | Ran Canetti, Rafail Ostrovsky: Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). STOC 1999: 255-264 | |
| 24 | 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 | Ran Canetti, Daniele Micciancio, Omer Reingold: Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC 1998: 131-140 | |
| 21 | Ran Canetti, Oded Goldreich, Shai Halevi: The Random Oracle Methodology, Revisited (Preliminary Version). STOC 1998: 209-218 | |
| 20 | 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 | Ran Canetti, Sandy Irani: Bounding the Power of Preemption in Randomized Scheduling. SIAM J. Comput. 27(4): 993-1015 (1998) | |
| 1997 | ||
| 18 | Ran Canetti: Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. CRYPTO 1997: 455-469 | |
| 17 | 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 | 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 | Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor: Adaptively Secure Multi-Party Computation. STOC 1996: 639-648 | |
| 10 | Ran Canetti: More on BPP and the Polynomial-Time Hierarchy. Inf. Process. Lett. 57(5): 237-241 (1996) | |
| 1995 | ||
| 9 | Ran Canetti, Sandy Irani: Bounding the power of preemption in randomized scheduling. STOC 1995: 606-615 | |
| 8 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber: Bandwidth allocation with preemption. STOC 1995: 616-625 | |
| 7 | 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 | Ran Canetti, Amir Herzberg: Maintaining Security in the Presence of Transient Faults. CRYPTO 1994: 425-438 | |
| 1993 | ||
| 5 | Ran Canetti, Tal Rabin: Fast asynchronous Byzantine agreement with optimal resilience. STOC 1993: 42-51 | |
| 4 | 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 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page