default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Canetti
Person information
- affiliation: Boston University, USA
- affiliation: Tel Aviv University, Israel
SPARQL queries 
🛈 Please note that only 61% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i120]Shlomi Hod, Ran Canetti:
Differentially Private Release of Israel's National Registry of Live Births. CoRR abs/2405.00267 (2024)- [i119]Ran Canetti, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein:
Towards general-purpose program obfuscation via local mixing. IACR Cryptol. ePrint Arch. 2024: 6 (2024) - 2023
- [c137]Jens Ernstberger, Jan Lauinger, Fatima Elsheimy, Liyi Zhou, Sebastian Steinhorst
, Ran Canetti, Andrew Miller, Arthur Gervais, Dawn Song:
SoK: Data Sovereignty. EuroS&P 2023: 122-143 - [c136]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the Computational Hardness Needed for Quantum Cryptography. ITCS 2023: 24:1-24:21 - [c135]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. TCC (2) 2023: 33-62 - [i118]Ran Canetti, Amos Fiat, Yannai A. Gonczarowski:
Zero-Knowledge Mechanisms. CoRR abs/2302.05590 (2023) - [i117]Claudio Chamon, Andrei E. Ruckenstein, Eduardo R. Mucciolo, Ran Canetti:
Circuit complexity and functionality: a thermodynamic perspective. CoRR abs/2309.05731 (2023) - [i116]Jens Ernstberger, Jan Lauinger, Fatima Elsheimy, Liyi Zhou, Sebastian Steinhorst, Ran Canetti, Andrew Miller, Arthur Gervais, Dawn Song:
SoK: Data Sovereignty. IACR Cryptol. ePrint Arch. 2023: 967 (2023) - [i115]Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov:
Taming Adaptivity in YOSO Protocols: The Modular Way. IACR Cryptol. ePrint Arch. 2023: 1077 (2023) - 2022
- [j33]Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model. SIAM J. Comput. 51(2): 17-333 (2022) - [c134]Ran Canetti, Pratik Sarkar, Xiao Wang:
Triply Adaptive UC NIZK. ASIACRYPT (2) 2022: 466-495 - [c133]Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia:
Universally Composable End-to-End Secure Messaging. CRYPTO (2) 2022: 3-33 - [c132]Dor Bitan, Ran Canetti, Shafi Goldwasser, Rebecca Wexler:
Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases. CSLAW 2022: 9-22 - [c131]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. EUROCRYPT (1) 2022: 731-758 - [c130]Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer:
Unclonable Polymers and Their Cryptographic Applications. EUROCRYPT (1) 2022: 759-789 - [i114]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. CoRR abs/2209.04101 (2022) - [i113]Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia:
Universally Composable End-to-End Secure Messaging. IACR Cryptol. ePrint Arch. 2022: 376 (2022) - [i112]Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer:
Unclonable Polymers and Their Cryptographic Applications. IACR Cryptol. ePrint Arch. 2022: 658 (2022) - [i111]Zvika Brakerski, Ran Canetti, Luowen Qian:
On the computational hardness needed for quantum cryptography. IACR Cryptol. ePrint Arch. 2022: 1181 (2022) - [i110]Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2022: 1781 (2022) - 2021
- [j32]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith:
Reusable Fuzzy Extractors for Low-Entropy Distributions. J. Cryptol. 34(1): 2 (2021) - [c129]Ran Canetti, Ari Karchmer:
Covert Learning: How to Learn with an Untrusted Intermediary. TCC (3) 2021: 1-31 - [i109]Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. IACR Cryptol. ePrint Arch. 2021: 60 (2021) - [i108]Ran Canetti, Ari Karchmer:
Covert Learning: How to Learn with an Untrusted Intermediary. IACR Cryptol. ePrint Arch. 2021: 764 (2021) - 2020
- [j31]Ran Canetti:
Universally Composable Security. J. ACM 67(5): 28:1-28:94 (2020) - [c128]Ran Canetti, Pratik Sarkar, Xiao Wang:
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. ASIACRYPT (3) 2020: 277-308 - [c127]Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. CCS 2020: 1769-1787 - [c126]Ran Canetti, Sunoo Park, Oxana Poburinnaya:
Fully Deniable Interactive Encryption. CRYPTO (1) 2020: 807-835 - [c125]Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov:
Universally Composable Accumulators. CT-RSA 2020: 638-666 - [c124]Ran Canetti, Marten van Dijk, Hoda Maleki, Ulrich Rührmair, Patrick Schaumont:
Using Universal Composition to Design and Analyze Secure Complex Hardware Systems. DATE 2020: 520-525 - [c123]Ran Canetti, Pratik Sarkar, Xiao Wang:
Blazing Fast OT for Three-Round UC OT Extension. Public Key Cryptography (2) 2020: 299-327 - [c122]Christian Badertscher, Ran Canetti, Julia Hesse, Björn Tackmann, Vassilis Zikas:
Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC. TCC (3) 2020: 1-30 - [c121]Ran Canetti, Oxana Poburinnaya:
Towards Multiparty Computation Withstanding Coercion of All Parties. TCC (2) 2020: 410-438 - [i107]Ran Canetti, Ari Trachtenberg, Mayank Varia:
Anonymous Collocation Discovery: Taming the Coronavirus While Preserving Privacy. CoRR abs/2003.13670 (2020) - [i106]Ran Canetti, Pratik Sarkar, Xiao Wang:
Blazing Fast OT for Three-Round UC OT Extension. IACR Cryptol. ePrint Arch. 2020: 110 (2020) - [i105]Ran Canetti, Nikolaos Makriyannis, Udi Peled:
UC Non-Interactive, Proactive, Threshold ECDSA. IACR Cryptol. ePrint Arch. 2020: 492 (2020) - [i104]Ran Canetti, Pratik Sarkar, Xiao Wang:
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. IACR Cryptol. ePrint Arch. 2020: 545 (2020) - [i103]Ran Canetti, Yael Tauman Kalai, Anna Lysyanskaya, Ronald L. Rivest, Adi Shamir, Emily Shen, Ari Trachtenberg, Mayank Varia, Daniel J. Weitzner:
Privacy-Preserving Automated Exposure Notification. IACR Cryptol. ePrint Arch. 2020: 863 (2020) - [i102]Christian Badertscher, Ran Canetti, Julia Hesse, Björn Tackmann, Vassilis Zikas:
Universal Composition with Global Subroutines: Capturing Global Setup within plain UC. IACR Cryptol. ePrint Arch. 2020: 1209 (2020) - [i101]Ran Canetti, Pratik Sarkar, Xiao Wang:
Triply Adaptive UC NIZK. IACR Cryptol. ePrint Arch. 2020: 1212 (2020) - [i100]Ran Canetti, Oxana Poburinnaya:
Towards Multiparty Computation Withstanding Coercion of All Parties. IACR Cryptol. ePrint Arch. 2020: 1434 (2020)
2010 – 2019
- 2019
- [c120]Ran Canetti, Alley Stoughton, Mayank Varia:
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. CSF 2019: 167-183 - [c119]Ran Canetti, Aloni Cohen, Nishanth Dikkala, Govind Ramnarayan, Sarah Scheffler, Adam D. Smith:
From Soft Classifiers to Hard Decisions: How fair can we be? FAT 2019: 309-318 - [c118]Kyle Hogan, Hoda Maleki, Reza Rahaeimehr, Ran Canetti, Marten van Dijk, Jason Hennessey, Mayank Varia, Haibin Zhang:
On the Universally Composable Security of OpenStack. SecDev 2019: 20-33 - [c117]Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs:
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [i99]Ran Canetti, Alley Stoughton, Mayank Varia:
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. IACR Cryptol. ePrint Arch. 2019: 582 (2019) - 2018
- [j30]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Task-structured probabilistic I/O automata. J. Comput. Syst. Sci. 94: 63-97 (2018) - [j29]Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan:
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [c116]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. EUROCRYPT (1) 2018: 91-122 - [c115]Ran Canetti, Amit Lichtenberg:
Certifying Trapdoor Permutations, Revisited. TCC (1) 2018: 476-506 - [i98]Ran Canetti, Aloni Cohen, Nishanth Dikkala, Govind Ramnarayan, Sarah Scheffler, Adam D. Smith:
From Soft Classifiers to Hard Decisions: How fair can we be? CoRR abs/1810.02003 (2018) - [i97]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. IACR Cryptol. ePrint Arch. 2018: 131 (2018) - [i96]Kyle Hogan, Hoda Maleki, Reza Rahaeimehr, Ran Canetti, Marten van Dijk, Jason Hennessey, Mayank Varia, Haibin Zhang:
On the Universally Composable Security of OpenStack. IACR Cryptol. ePrint Arch. 2018: 602 (2018) - [i95]Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum:
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018: 1004 (2018) - [i94]Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov:
Universally Composable Accumulators. IACR Cryptol. ePrint Arch. 2018: 1241 (2018) - [i93]Ran Canetti, Sunoo Park, Oxana Poburinnaya:
Fully Bideniable Interactive Encryption. IACR Cryptol. ePrint Arch. 2018: 1244 (2018) - [i92]Ran Canetti, Alex Lombardi, Daniel Wichs:
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. IACR Cryptol. ePrint Arch. 2018: 1248 (2018) - 2017
- [j28]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79(4): 1014-1051 (2017) - [j27]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. J. Cryptol. 30(4): 989-1066 (2017) - [c114]Ran Canetti, Oxana Poburinnaya, Mariana Raykova:
Optimal-Rate Non-Committing Encryption. ASIACRYPT (3) 2017: 212-241 - [c113]Ran Canetti, Kyle Hogan, Aanchal Malhotra, Mayank Varia:
A Universally Composable Treatment of Network Time. CSF 2017: 360-375 - [c112]Ran Canetti, Yilei Chen:
Constraint-Hiding Constrained PRFs for NC1 from LWE. EUROCRYPT (1) 2017: 446-476 - [c111]Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) 2017: 213-240 - [c110]Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Better Two-Round Adaptive Multi-party Computation. Public Key Cryptography (2) 2017: 396-427 - [c109]Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model. STOC 2017: 497-509 - [c108]Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. TCC (2) 2017: 694-726 - [i91]Ran Canetti, Yilei Chen:
Constraint-hiding Constrained PRFs for NC1 from LWE. IACR Cryptol. ePrint Arch. 2017: 143 (2017) - [i90]Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. 2017: 568 (2017) - [i89]Ran Canetti, Amit Lichtenberg:
Certifying Trapdoor Permutations, Revisited. IACR Cryptol. ePrint Arch. 2017: 631 (2017) - [i88]Ran Canetti, Kyle Hogan, Aanchal Malhotra, Mayank Varia:
A Universally Composable Treatment of Network Time. IACR Cryptol. ePrint Arch. 2017: 1256 (2017) - 2016
- [j26]Gilad Asharov, Ran Canetti, Carmit Hazay:
Toward a Game Theoretic View of Secure Computation. J. Cryptol. 29(4): 879-926 (2016) - [j25]Ran Canetti, Huijia Lin, Rafael Pass:
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. SIAM J. Comput. 45(5): 1793-1834 (2016) - [j24]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45(5): 1910-1952 (2016) - [c107]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith:
Reusable Fuzzy Extractors for Low-Entropy Distributions. EUROCRYPT (1) 2016: 117-146 - [c106]Ran Canetti, Justin Holmgren:
Fully Succinct Garbled RAM. ITCS 2016: 169-178 - [c105]Ran Canetti, Daniel Shahaf, Margarita Vald:
Universally Composable Authentication and Key-Exchange with Global PKI. Public Key Cryptography (2) 2016: 265-296 - [c104]Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova:
Adaptive Succinct Garbled RAM or: How to Delegate Your Database. TCC (B2) 2016: 61-90 - [c103]Ran Canetti, Yilei Chen, Leonid Reyzin:
On the Correlation Intractability of Obfuscated Pseudorandom Functions. TCC (A1) 2016: 389-415 - [i87]Ran Canetti, Oxana Poburinnaya, Mariana Raykova:
Optimal-Rate Non-Committing Encryption in a CRS Model. IACR Cryptol. ePrint Arch. 2016: 511 (2016) - [i86]Ran Canetti, Oxana Poburinnaya:
Better Two-Round Adaptive Multiparty Computation. IACR Cryptol. ePrint Arch. 2016: 614 (2016) - [i85]Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2016: 1190 (2016) - 2015
- [c102]Ran Canetti, Asaf Cohen, Yehuda Lindell:
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. CRYPTO (2) 2015: 3-22 - [c101]Ran Canetti, Vipul Goyal, Abhishek Jain:
Concurrent Secure Computation with Optimal Query Complexity. CRYPTO (2) 2015: 43-62 - [c100]Charalampos Mavroforakis, Nathan Chenette, Adam O'Neill, George Kollios, Ran Canetti:
Modular Order-Preserving Encryption, Revisited. SIGMOD Conference 2015: 763-777 - [c99]Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan:
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. STOC 2015: 429-437 - [c98]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. TCC (2) 2015: 456-467 - [c97]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. TCC (2) 2015: 468-497 - [c96]Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya:
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation. TCC (2) 2015: 557-585 - [i84]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. IACR Cryptol. ePrint Arch. 2015: 48 (2015) - [i83]Ran Canetti, Yilei Chen, Leonid Reyzin:
On the Correlation Intractability of Obfuscated Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2015: 334 (2015) - [i82]Ran Canetti, Justin Holmgren:
Fully Succinct Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 388 (2015) - [i81]Ran Canetti, Vipul Goyal, Abhishek Jain:
Concurrent Secure Computation with Optimal Query Complexity. IACR Cryptol. ePrint Arch. 2015: 559 (2015) - [i80]Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova:
Succinct Adaptive Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 1074 (2015) - 2014
- [j23]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. J. Cryptol. 27(2): 317-357 (2014) - [c95]Ran Canetti, Abhishek Jain, Alessandra Scafuro:
Practical UC security with a Global Random Oracle. CCS 2014: 597-608 - [c94]Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) 2014: 71-89 - [c93]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. CRYPTO (2) 2014: 108-125 - [c92]Ran Canetti, Abhishek Jain, Omer Paneth:
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. CRYPTO (2) 2014: 337-350 - [c91]Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos:
Verifiable Set Operations over Outsourced Databases. Public Key Cryptography 2014: 113-130 - [c90]Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis:
Secure Key Exchange and Sessions without Credentials. SCN 2014: 40-56 - [c89]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the existence of extractable one-way functions. STOC 2014: 505-514 - [c88]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - [i79]Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin:
Key Derivation From Noisy Sources With More Errors Than Entropy. IACR Cryptol. ePrint Arch. 2014: 243 (2014) - [i78]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 402 (2014) - [i77]Ran Canetti, Daniel Shahaf, Margarita Vald:
Composable Authentication with Global PKI. IACR Cryptol. ePrint Arch. 2014: 432 (2014) - [i76]Ran Canetti, Asaf Cohen, Yehuda Lindell:
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 553 (2014) - [i75]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. IACR Cryptol. ePrint Arch. 2014: 554 (2014) - [i74]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. IACR Cryptol. ePrint Arch. 2014: 580 (2014) - [i73]Ran Canetti, Abhishek Jain, Omer Paneth:
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. IACR Cryptol. ePrint Arch. 2014: 633 (2014) - [i72]Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan:
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs. IACR Cryptol. ePrint Arch. 2014: 769 (2014) - [i71]Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya:
Adaptively Secure Two-party Computation From Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 845 (2014) - [i70]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. IACR Cryptol. ePrint Arch. 2014: 882 (2014) - [i69]Ran Canetti, Abhishek Jain, Alessandra Scafuro:
Practical UC security with a Global Random Oracle. IACR Cryptol. ePrint Arch. 2014: 908 (2014) - 2013
- [j22]Ran Canetti, Ben Riva, Guy N. Rothblum:
Refereed delegation of computation. Inf. Comput. 226: 16-36 (2013) - [c87]Ran Canetti, Huijia Lin, Rafael Pass:
From Unprovability to Environmentally Friendly Protocols. FOCS 2013: 70-79 - [c86]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive composition and bootstrapping for SNARKS and proof-carrying data. STOC 2013: 111-120 - [c85]Ran Canetti, Huijia Lin, Omer Paneth:
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. TCC 2013: 80-99 - [p1]Ran Canetti:
Security and Composition of Cryptographic Protocols: A Tutorial. Secure Multi-Party Computation 2013: 61-119 - [e5]Ran Canetti, Juan A. Garay:
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I. Lecture Notes in Computer Science 8042, Springer 2013, ISBN 978-3-642-40040-7 [contents] - [e4]Ran Canetti, Juan A. Garay:
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II. Lecture Notes in Computer Science 8043, Springer 2013, ISBN 978-3-642-40083-4 [contents] - [i68]Nir Bitansky, Ran Canetti, Omer Paneth:
How To Construct Extractable One-Way Functions Against Uniform Adversaries. IACR Cryptol. ePrint Arch. 2013: 468 (2013) - [i67]Ran Canetti, Vinod Vaikuntanathan:
Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups. IACR Cryptol. ePrint Arch. 2013: 500 (2013) - [i66]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. IACR Cryptol. ePrint Arch. 2013: 641 (2013) - [i65]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. IACR Cryptol. ePrint Arch. 2013: 668 (2013) - [i64]Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis:
Secure Key Exchange and Sessions Without Credentials. IACR Cryptol. ePrint Arch. 2013: 693 (2013) - [i63]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 701 (2013) - [i62]Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos:
Verifiable Set Operations over Outsourced Databases. IACR Cryptol. ePrint Arch. 2013: 724 (2013) - 2012
- [c84]Ran Canetti, Ben Riva, Guy N. Rothblum:
Two Protocols for Delegation of Computation. ICITS 2012: 37-61 - [c83]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 - [c82]Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee:
Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466 - [c81]Ran Canetti, Margarita Vald:
Universally Composable Security with Local Adversaries. SCN 2012: 281-301 - [c80]Nir Bitansky, Ran Canetti, Shai Halevi:
Leakage-Tolerant Interactive Protocols. TCC 2012: 266-284 - [e3]Reihaneh Safavi-Naini, Ran Canetti:
Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings. Lecture Notes in Computer Science 7417, Springer 2012, ISBN 978-3-642-32008-8 [contents] - [i61]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptol. ePrint Arch. 2012: 95 (2012) - [i60]Ran Canetti, Margarita Vald:
Universally Composable Security With Local Adversaries. IACR Cryptol. ePrint Arch. 2012: 117 (2012) - 2011
- [j21]Ran Canetti, Jonathan Herzog:
Universally Composable Symbolic Security Analysis. J. Cryptol. 24(1): 83-147 (2011) - [j20]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. J. Cryptol. 24(4): 720-760 (2011) - [c79]Ran Canetti, Suresh Chari, Shai Halevi, Birgit Pfitzmann, Arnab Roy, Michael Steiner, Wietse Z. Venema:
Composable Security Analysis of OS Services. ACNS 2011: 431-448 - [c78]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 - [c77]Ran Canetti, Ben Riva, Guy N. Rothblum:
Practical delegation of computation using multiple servers. CCS 2011: 445-454 - [c76]Gilad Asharov, Ran Canetti, Carmit Hazay:
Towards a Game Theoretic View of Secure Computation. EUROCRYPT 2011: 426-445 - [r2]Ran Canetti, Mayank Varia:
Decisional Diffie-Hellman Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 316-319 - [i59]Gilad Asharov, Ran Canetti, Carmit Hazay:
Towards a Game Theoretic View of Secure Computation. IACR Cryptol. ePrint Arch. 2011: 137 (2011) - [i58]Nir Bitansky, Ran Canetti, Shai Halevi:
Leakage Tolerant Interactive Protocols. IACR Cryptol. ePrint Arch. 2011: 204 (2011) - [i57]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptol. ePrint Arch. 2011: 443 (2011) - [i56]Ran Canetti, Ben Riva, Guy N. Rothblum:
Two 1-Round Protocols for Delegation of Computation. IACR Cryptol. ePrint Arch. 2011: 518 (2011) - [i55]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. IACR Cryptol. ePrint Arch. 2011: 660 (2011) - 2010
- [c75]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. CRYPTO 2010: 520-537 - [c74]Ran Canetti, Huijia Lin, Rafael Pass:
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. FOCS 2010: 541-550 - [c73]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. TCC 2010: 52-71 - [c72]Ran Canetti, Guy N. Rothblum, Mayank Varia:
Obfuscation of Hyperplane Membership. TCC 2010: 72-89 - [i54]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. IACR Cryptol. ePrint Arch. 2010: 49 (2010) - [i53]Ran Canetti, Suresh Chari, Shai Halevi, Birgit Pfitzmann, Arnab Roy, Michael Steiner, Wietse Z. Venema:
Composable Security Analysis of OS Services. IACR Cryptol. ePrint Arch. 2010: 213 (2010) - [i52]Ran Canetti, Sebastian Gajek:
Universally Composable Symbolic Analysis of Diffie-Hellman based Key Exchange. IACR Cryptol. ePrint Arch. 2010: 303 (2010) - [i51]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. IACR Cryptol. ePrint Arch. 2010: 414 (2010)
2000 – 2009
- 2009
- [c71]Ran Canetti, Mayank Varia:
Non-malleable Obfuscation. TCC 2009: 73-90 - [c70]Ran Canetti, Ronny Ramzi Dakdouk:
Towards a Theory of Extractable Functions. TCC 2009: 595-613 - 2008
- [j19]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discret. Event Dyn. Syst. 18(1): 111-159 (2008) - [c69]Waseem Daher, Ran Canetti:
POSH: a generalized captcha with security applications. AISec 2008: 1-10 - [c68]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. CONCUR 2008: 114-130 - [c67]Ran Canetti, Ronny Ramzi Dakdouk:
Obfuscating Point Functions with Multibit Output. EUROCRYPT 2008: 489-508 - [c66]Ran Canetti:
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency. ICALP (2) 2008: 1-13 - [c65]Ran Canetti, Ronny Ramzi Dakdouk:
Extractable Perfectly One-Way Functions. ICALP (2) 2008: 449-460 - [c64]Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim:
How to Protect Yourself without Perfect Shredding. ICALP (2) 2008: 511-523 - [e2]Ran Canetti, Shafi Goldwasser, Günter Müller, Rainer Steinwandt:
Theoretical Foundations of Practical Information Security, 30.11. - 05.12.2008. Dagstuhl Seminar Proceedings 08491, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [e1]Ran Canetti:
Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Lecture Notes in Computer Science 4948, Springer 2008, ISBN 978-3-540-78523-1 [contents] - [i50]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. Theoretical Foundations of Practical Information Security 2008 - [i49]Ran Canetti, Shafi Goldwasser, Günter Müller, Rainer Steinwandt:
08491 Abstracts Collection - Theoretical Foundations of Practical Information Security. Theoretical Foundations of Practical Information Security 2008 - [i48]Ran Canetti, Shafi Goldwasser, Günter Müller, Rainer Steinwandt:
08491 Executive Summary - Theoretical Foundations of Practical Information Security. Theoretical Foundations of Practical Information Security 2008 - [i47]Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim:
How to Protect Yourself without Perfect Shredding. IACR Cryptol. ePrint Arch. 2008: 291 (2008) - [i46]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems, Version 2. IACR Cryptol. ePrint Arch. 2008: 492 (2008) - [i45]Ran Canetti, Mayank Varia:
Non-Malleable Obfuscation. IACR Cryptol. ePrint Arch. 2008: 495 (2008) - 2007
- [j18]Ran Canetti, Shai Halevi, Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme. J. Cryptol. 20(3): 265-294 (2007) - [j17]Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption. SIAM J. Comput. 36(5): 1301-1328 (2007) - [c63]Ran Canetti:
Obtaining Universally Compoable Security: Towards the Bare Bones of Trust. ASIACRYPT 2007: 88-112 - [c62]Ran Canetti, Susan Hohenberger:
Chosen-ciphertext secure proxy re-encryption. CCS 2007: 185-194 - [c61]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 - [c60]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Compositional Security for Task-PIOAs. CSF 2007: 125-139 - [c59]Ran Canetti, Rafael Pass, Abhi Shelat:
Cryptography from Sunspots: How to Use an Imperfect Reference String. FOCS 2007: 249-259 - [c58]Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
Universally Composable Security with Global Setup. TCC 2007: 61-85 - [i44]Ran Canetti, Ling Cheung, Nancy A. Lynch, Olivier Pereira:
On the Role of Scheduling in Simulation-Based Security. IACR Cryptol. ePrint Arch. 2007: 102 (2007) - [i43]Ran Canetti, Susan Hohenberger:
Chosen-Ciphertext Secure Proxy Re-Encryption. IACR Cryptol. ePrint Arch. 2007: 171 (2007) - [i42]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
Modeling Computational Security in Long-Lived Systems. IACR Cryptol. ePrint Arch. 2007: 406 (2007) - [i41]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. IACR Cryptol. ePrint Arch. 2007: 464 (2007) - [i40]Ran Canetti:
Obtaining Universally Composable Security: Towards the Bare Bones of Trust. IACR Cryptol. ePrint Arch. 2007: 475 (2007) - 2006
- [j16]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptol. 19(2): 135-167 (2006) - [j15]Ran Canetti:
Security and composition of cryptographic protocols: a tutorial (part I). SIGACT News 37(3): 67-92 (2006) - [c57]Ran Canetti, Shai Halevi, Michael Steiner:
Mitigating Dictionary Attacks on Password-Protected Local Storage. CRYPTO 2006: 160-179 - [c56]Ran Canetti, Jonathan Herzog:
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. TCC 2006: 380-403 - [c55]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. DISC 2006: 238-253 - [i39]Ran Canetti, Shai Halevi, Michael Steiner:
Mitigating Dictionary Attacks on Password-Protected Local Storage. IACR Cryptol. ePrint Arch. 2006: 276 (2006) - [i38]Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
Universally Composable Security with Global Setup. IACR Cryptol. ePrint Arch. 2006: 432 (2006) - [i37]Ran Canetti:
Security and Composition of Cryptographic Protocols: A Tutorial. IACR Cryptol. ePrint Arch. 2006: 465 (2006) - 2005
- [j14]Ran Canetti:
Preface. J. Cryptol. 18(3): 187-189 (2005) - [c54]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. CRYPTO 2005: 361-377 - [c53]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 - [c52]Ran Canetti, Shai Halevi, Michael Steiner:
Hardness Amplification of Weakly Verifiable Puzzles. TCC 2005: 17-33 - [c51]Ran Canetti, Shai Halevi, Jonathan Katz:
Adaptively-Secure, Non-interactive Public-Key Encryption. TCC 2005: 150-168 - [r1]Ran Canetti:
Decisional Diffie-Hellman Assumption. Encyclopedia of Cryptography and Security 2005 - [i36]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. IACR Cryptol. ePrint Arch. 2005: 196 (2005) - [i35]Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala:
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. IACR Cryptol. ePrint Arch. 2005: 452 (2005) - [i34]Mark Baugher, Ran Canetti, Lakshminath R. Dondeti, Fredrik Lindholm:
Multicast Security (MSEC) Group Key Management Architecture. RFC 4046: 1-38 (2005) - [i33]Adrian Perrig, Dawn Song, Ran Canetti, J. D. Tygar, Bob Briscoe:
Timed Efficient Stream Loss-Tolerant Authentication (TESLA): Multicast Source Authentication Transform Introduction. RFC 4082: 1-22 (2005) - 2004
- [j13]Ran Canetti, Oded Goldreich, Shai Halevi:
The random oracle methodology, revisited. J. ACM 51(4): 557-594 (2004) - [j12]Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
Adaptive versus Non-Adaptive Security of Multi-Party Protocols. J. Cryptol. 17(3): 153-207 (2004) - [j11]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) - [c50]Ran Canetti:
Universally Composable Signature, Certification, and Authentication. CSFW 2004: 219- - [c49]Ran Canetti, Shai Halevi, Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption. EUROCRYPT 2004: 207-222 - [c48]Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass:
Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 - [c47]Ran Canetti, Oded Goldreich, Shai Halevi:
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. TCC 2004: 40-57 - [i32]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptol. ePrint Arch. 2004: 116 (2004) - [i31]Ran Canetti, Shai Halevi, Jonathan Katz:
Adaptively-Secure, Non-Interactive Public-Key Encryption. IACR Cryptol. ePrint Arch. 2004: 317 (2004) - [i30]Ran Canetti, Shai Halevi, Michael Steiner:
Hardness amplification of weakly verifiable puzzles. IACR Cryptol. ePrint Arch. 2004: 329 (2004) - [i29]Ran Canetti, Jonathan Herzog:
Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange). IACR Cryptol. ePrint Arch. 2004: 334 (2004) - 2003
- [c46]Ran Canetti, Tal Rabin:
Universal Composition with Joint State. CRYPTO 2003: 265-281 - [c45]Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen:
Relaxing Chosen-Ciphertext Security. CRYPTO 2003: 565-582 - [c44]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 - [c43]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86 - [c42]Ran Canetti, Shai Halevi, Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme. EUROCRYPT 2003: 255-271 - [i28]Ran Canetti, Shai Halevi, Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme. IACR Cryptol. ePrint Arch. 2003: 83 (2003) - [i27]Ran Canetti, Oded Goldreich, Shai Halevi:
On the random-oracle methodology as applied to length-restricted signature schemes. IACR Cryptol. ePrint Arch. 2003: 150 (2003) - [i26]Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen:
Relaxing Chosen-Ciphertext Security. IACR Cryptol. ePrint Arch. 2003: 174 (2003) - [i25]Ran Canetti, Shai Halevi, Jonathan Katz:
Chosen-Ciphertext Security from Identity-Based Encryption. IACR Cryptol. ePrint Arch. 2003: 182 (2003) - [i24]Ran Canetti:
Universally Composable Signatures, Certification and Authentication. IACR Cryptol. ePrint Arch. 2003: 239 (2003) - 2002
- [j10]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) - [c41]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. CCS 2002: 48-58 - [c40]Ran Canetti, Hugo Krawczyk:
Security Analysis of IKE's Signature-Based Key-Exchange Protocol. CRYPTO 2002: 143-161 - [c39]Ran Canetti, Hugo Krawczyk:
Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002: 337-351 - [c38]Ran Canetti, Catherine Meadows, Paul F. Syverson:
Environmental Requirements for Authentication Protocols. ISSS 2002: 339-355 - [c37]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 - [c36]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally composable two-party and multi-party secure computation. STOC 2002: 494-503 - [i23]Ran Canetti, Tal Rabin:
Universal Composition with Joint State. IACR Cryptol. ePrint Arch. 2002: 47 (2002) - [i22]Ran Canetti, Hugo Krawczyk:
Universally Composable Notions of Key Exchange and Secure Channels. IACR Cryptol. ePrint Arch. 2002: 59 (2002) - [i21]Ran Canetti, Hugo Krawczyk:
Security Analysis of IKE's Signature-based Key-Exchange Protocol. IACR Cryptol. ePrint Arch. 2002: 120 (2002) - [i20]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally Composable Two-Party and Multi-Party Secure Computation. IACR Cryptol. ePrint Arch. 2002: 140 (2002) - 2001
- [c35]Ran Canetti, Marc Fischlin:
Universally Composable Commitments. CRYPTO 2001: 19-40 - [c34]Andre Scedrov, Ran Canetti, Joshua D. Guttman, David A. Wagner, Michael Waidner:
Relating Cryptography and Cryptographic Protocols. CSFW 2001: 111-114 - [c33]Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279 - [c32]Ran Canetti, Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. EUROCRYPT 2001: 453-474 - [c31]Ran Canetti:
Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145 - [c30]Adrian Perrig, Ran Canetti, Dawn Xiaodong Song, J. D. Tygar:
Efficient and Secure Source Authentication for Multicast. NDSS 2001 - [c29]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 - [c28]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 - [c27]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579 - [i19]Ran Canetti:
A unified framework for analyzing security of protocols. Electron. Colloquium Comput. Complex. TR01 (2001) - [i18]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds. Electron. Colloquium Comput. Complex. TR01 (2001) - [i17]Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
On adaptive vs. non-adaptive security of multiparty protocols. IACR Cryptol. ePrint Arch. 2001: 17 (2001) - [i16]Ran Canetti, Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. IACR Cryptol. ePrint Arch. 2001: 40 (2001) - [i15]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptol. ePrint Arch. 2001: 51 (2001) - [i14]Ran Canetti, Marc Fischlin:
Universally Composable Commitments. IACR Cryptol. ePrint Arch. 2001: 55 (2001) - 2000
- [j9]Ran Canetti, Shai Halevi, Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-Ins. J. Cryptol. 13(1): 61-105 (2000) - [j8]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. J. Cryptol. 13(1): 107-142 (2000) - [j7]Ran Canetti:
Security and Composition of Multiparty Cryptographic Protocols. J. Cryptol. 13(1): 143-202 (2000) - [c26]Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai:
Exposure-Resilient Functions and All-or-Nothing Transforms. EUROCRYPT 2000: 453-469 - [c25]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 - [c24]Adrian Perrig, Ran Canetti, J. D. Tygar, Dawn Xiaodong Song:
Efficient Authentication and Signing of Multicast Streams over Lossy Channels. S&P 2000: 56-73 - [c23]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 - [i13]Ran Canetti, Oded Goldreich, Shai Halevi:
The Random Oracle Methodology, Revisited. CoRR cs.CR/0010019 (2000) - [i12]Ran Canetti:
Universally Composable Security: A New Paradigm for Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2000: 67 (2000)
1990 – 1999
- 1999
- [j6]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999) - [c22]Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin:
Adaptive Security for Threshold Cryptosystems. CRYPTO 1999: 98-115 - [c21]Ran Canetti, Shafi Goldwasser:
An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. EUROCRYPT 1999: 90-106 - [c20]Ran Canetti, Tal Malkin, Kobbi Nissim:
Efficient Communication-Storage Tradeoffs for Multicast Encryption. EUROCRYPT 1999: 459-474 - [c19]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 - [c18]Ran Canetti, Rafail Ostrovsky:
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). STOC 1999: 255-264 - [i11]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable Zero-Knowledge. Electron. Colloquium Comput. Complex. TR99 (1999) - [i10]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable Zero-Knowledge. IACR Cryptol. ePrint Arch. 1999: 22 (1999) - 1998
- [j5]Ran Canetti, Sandy Irani:
Bounding the Power of Preemption in Randomized Scheduling. SIAM J. Comput. 27(4): 993-1015 (1998) - [c17]Ran Canetti, Daniele Micciancio, Omer Reingold:
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC 1998: 131-140 - [c16]Ran Canetti, Oded Goldreich, Shai Halevi:
The Random Oracle Methodology, Revisited (Preliminary Version). STOC 1998: 209-218 - [c15]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 - [i9]Mihir Bellare, Ran Canetti, Hugo Krawczyk:
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. IACR Cryptol. ePrint Arch. 1998: 9 (1998) - [i8]Ran Canetti, Oded Goldreich, Shai Halevi:
The Random Oracle Methodology, Revisited. IACR Cryptol. ePrint Arch. 1998: 11 (1998) - [i7]Ran Canetti, Shai Halevi, Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins. IACR Cryptol. ePrint Arch. 1998: 12 (1998) - [i6]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. IACR Cryptol. ePrint Arch. 1998: 14 (1998) - [i5]Ran Canetti:
Security and Composition of Multi-party Cryptographic Protocols. IACR Cryptol. ePrint Arch. 1998: 18 (1998) - 1997
- [c14]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. CRYPTO 1997: 90-104 - [c13]Ran Canetti:
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. CRYPTO 1997: 455-469 - [c12]Ran Canetti, Shai Halevi, Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins. PODC 1997: 15-24 - [c11]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness vs. Fault-Tolerance. PODC 1997: 35-44 - [i4]Ran Canetti:
Towards realizing random oracles: Hash functions that hide all partial information. IACR Cryptol. ePrint Arch. 1997: 7 (1997) - [i3]Hugo Krawczyk, Mihir Bellare, Ran Canetti:
HMAC: Keyed-Hashing for Message Authentication. RFC 2104: 1-11 (1997) - 1996
- [j4]Ran Canetti:
More on BPP and the Polynomial-Time Hierarchy. Inf. Process. Lett. 57(5): 237-241 (1996) - [c10]Mihir Bellare, Ran Canetti, Hugo Krawczyk:
Keying Hash Functions for Message Authentication. CRYPTO 1996: 1-15 - [c9]Ran Canetti, Rosario Gennaro:
Incoercible Multiparty Computation (extended abstract). FOCS 1996: 504-513 - [c8]Mihir Bellare, Ran Canetti, Hugo Krawczyk:
Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. FOCS 1996: 514-523 - [c7]Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor:
Adaptively Secure Multi-Party Computation. STOC 1996: 639-648 - [i2]Ran Canetti, Rosario Gennaro:
Incoercible Multiparty Computation. IACR Cryptol. ePrint Arch. 1996: 1 (1996) - [i1]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. IACR Cryptol. ePrint Arch. 1996: 2 (1996) - 1995
- [j3]Ran Canetti, Guy Even, Oded Goldreich:
Lower Bounds for Sampling Algorithms for Estimating the Average. Inf. Process. Lett. 53(1): 17-25 (1995) - [c6]Ran Canetti, Sandy Irani:
Bounding the power of preemption in randomized scheduling. STOC 1995: 606-615 - [c5]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth allocation with preemption. STOC 1995: 616-625 - 1994
- [c4]Ran Canetti, Amir Herzberg:
Maintaining Security in the Presence of Transient Faults. CRYPTO 1994: 425-438 - 1993
- [j2]Ran Canetti, Oded Goldreich:
Bounds on Tradeoffs Between Randomness and Communication Complexity. Comput. Complex. 3: 141-167 (1993) - [c3]Ran Canetti, Tal Rabin:
Fast asynchronous Byzantine agreement with optimal resilience. STOC 1993: 42-51 - [c2]Michael Ben-Or, Ran Canetti, Oded Goldreich:
Asynchronous secure computation. STOC 1993: 52-61 - 1991
- [j1]Ran Canetti, L. Paul Fertig, Saul A. Kravitz, Dalia Malki, Ron Y. Pinter, Sara Porat, Avi Teperman:
The parallel C (pC) programming language. IBM J. Res. Dev. 35(5): 727-742 (1991) - 1990
- [c1]Ran Canetti, Oded Goldreich:
Bounds on Tradeoffs between Randomness and Communication Complexity. FOCS 1990: 766-775
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
