Ran Canetti

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 81

Top Venues

IACR Cryptol. ePrint Arch.

TCC (2)

CRYPTO (2)

CoRR

Publications

Shlomi Hod, Ran Canetti
Differentially Private Release of Israel's National Registry of Live Births. CoRR (2024)
Ran Canetti, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
Towards general-purpose program obfuscation via local mixing. IACR Cryptol. ePrint Arch. 2024 (2024)
Jens Ernstberger, Jan Lauinger, Fatima Elsheimy, Liyi Zhou, Sebastian Steinhorst, Ran Canetti, Andrew Miller, Arthur Gervais, Dawn Song
SoK: Data Sovereignty. EuroS&P (2023)
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 (2023)
Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov
Taming Adaptivity in YOSO Protocols: The Modular Way. TCC (2) (2023)
Ran Canetti, Sebastian Kolby, Divya Ravi, Eduardo Soria-Vazquez, Sophia Yakoubov
Taming Adaptivity in YOSO Protocols: The Modular Way. IACR Cryptol. ePrint Arch. 2023 (2023)
Ran Canetti, Amos Fiat, Yannai A. Gonczarowski
Zero-Knowledge Mechanisms. CoRR (2023)
Claudio Chamon, Andrei E. Ruckenstein, Eduardo R. Mucciolo, Ran Canetti
Circuit complexity and functionality: a thermodynamic perspective. CoRR (2023)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the Computational Hardness Needed for Quantum Cryptography. ITCS (2023)
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)
Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran
COA-Secure Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model. SIAM J. Comput. 51 (2) (2022)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the computational hardness needed for quantum cryptography. IACR Cryptol. ePrint Arch. 2022 (2022)
Zvika Brakerski, Ran Canetti, Luowen Qian
On the computational hardness needed for quantum cryptography. CoRR (2022)
Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia
Universally Composable End-to-End Secure Messaging. CRYPTO (2) (2022)
Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran
COA-Secure Obfuscation and Applications. EUROCRYPT (1) (2022)
Ran Canetti, Pratik Sarkar, Xiao Wang
Triply Adaptive UC NIZK. ASIACRYPT (2) (2022)
Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia
Universally Composable End-to-End Secure Messaging. IACR Cryptol. ePrint Arch. 2022 (2022)
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 (2022)
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)
Ran Canetti, Ari Karchmer
Covert Learning: How to Learn with an Untrusted Intermediary. TCC (3) (2021)
Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. IACR Cryptol. ePrint Arch. 2021 (2021)
Ran Canetti, Ari Karchmer
Covert Learning: How to Learn with an Untrusted Intermediary. IACR Cryptol. ePrint Arch. 2021 (2021)
Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith
Reusable Fuzzy Extractors for Low-Entropy Distributions. J. Cryptol. 34 (1) (2021)
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 (2020)
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 (2020)
Ran Canetti, Oxana Poburinnaya
Towards Multiparty Computation Withstanding Coercion of All Parties. IACR Cryptol. ePrint Arch. 2020 (2020)
Ran Canetti, Ari Trachtenberg, Mayank Varia
Anonymous Collocation Discovery: Taming the Coronavirus While Preserving Privacy. CoRR (2020)
Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov
Universally Composable Accumulators. CT-RSA (2020)
Ran Canetti, Pratik Sarkar, Xiao Wang
Blazing Fast OT for Three-Round UC OT Extension. Public Key Cryptography (2) (2020)
Ran Canetti, Pratik Sarkar, Xiao Wang
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. IACR Cryptol. ePrint Arch. 2020 (2020)
Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, Udi Peled
UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. CCS (2020)
Ran Canetti
Universally Composable Security. J. ACM 67 (5) (2020)
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)
Ran Canetti, Nikolaos Makriyannis, Udi Peled
UC Non-Interactive, Proactive, Threshold ECDSA. IACR Cryptol. ePrint Arch. 2020 (2020)
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)
Ran Canetti, Oxana Poburinnaya
Towards Multiparty Computation Withstanding Coercion of All Parties. TCC (2) (2020)
Ran Canetti, Sunoo Park, Oxana Poburinnaya
Fully Deniable Interactive Encryption. CRYPTO (1) (2020)
Ran Canetti, Pratik Sarkar, Xiao Wang
Blazing Fast OT for Three-Round UC OT Extension. IACR Cryptol. ePrint Arch. 2020 (2020)
Ran Canetti, Pratik Sarkar, Xiao Wang
Triply Adaptive UC NIZK. IACR Cryptol. ePrint Arch. 2020 (2020)
Ran Canetti, Pratik Sarkar, Xiao Wang
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. ASIACRYPT (3) (2020)
Ran Canetti, Alley Stoughton, Mayank Varia
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. IACR Cryptol. ePrint Arch. 2019 (2019)
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)
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
Fiat-Shamir: from practice to theory. STOC (2019)
Ran Canetti, Alley Stoughton, Mayank Varia
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. CSF (2019)
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)
Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Ran Canetti, Sunoo Park, Oxana Poburinnaya
Fully Bideniable Interactive Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
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) (2018)
Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. EUROCRYPT (1) (2018)
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018 (2018)
Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov
Universally Composable Accumulators. IACR Cryptol. ePrint Arch. 2018 (2018)
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 (2018)
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 (2018)
Ran Canetti, Alex Lombardi, Daniel Wichs
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. IACR Cryptol. ePrint Arch. 2018 (2018)
Ran Canetti, Amit Lichtenberg
Certifying Trapdoor Permutations, Revisited. TCC (1) (2018)
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 (2018)
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Better Two-Round Adaptive Multi-party Computation. Public Key Cryptography (2) (2017)
Ran Canetti, Justin Holmgren, Silas Richelson
Towards Doubly Efficient Private Information Retrieval. TCC (2) (2017)
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer
The Hunting of the SNARK. J. Cryptol. 30 (4) (2017)
Ran Canetti, Oxana Poburinnaya, Mariana Raykova
Optimal-Rate Non-Committing Encryption. ASIACRYPT (3) (2017)
Ran Canetti, Justin Holmgren, Silas Richelson
Towards Doubly Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. 2017 (2017)
Ran Canetti, Yilei Chen
Constraint-hiding Constrained PRFs for NC1 from LWE. IACR Cryptol. ePrint Arch. 2017 (2017)
Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79 (4) (2017)
Ran Canetti, Yilei Chen
from LWE. EUROCRYPT (1) (2017)
Ran Canetti, Kyle Hogan, Aanchal Malhotra, Mayank Varia
A Universally Composable Treatment of Network Time. CSF (2017)
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model. STOC (2017)
Ran Canetti, Amit Lichtenberg
Certifying Trapdoor Permutations, Revisited. IACR Cryptol. ePrint Arch. 2017 (2017)
Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) (2017)
Ran Canetti, Kyle Hogan, Aanchal Malhotra, Mayank Varia
A Universally Composable Treatment of Network Time. IACR Cryptol. ePrint Arch. 2017 (2017)
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Gilad Asharov, Ran Canetti, Carmit Hazay
Toward a Game Theoretic View of Secure Computation. J. Cryptol. 29 (4) (2016)
Ran Canetti, Yilei Chen, Leonid Reyzin
On the Correlation Intractability of Obfuscated Pseudorandom Functions. TCC (A1) (2016)
Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith
Reusable Fuzzy Extractors for Low-Entropy Distributions. EUROCRYPT (1) (2016)
Ran Canetti, Huijia Lin, Rafael Pass
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. SIAM J. Comput. 45 (5) (2016)
Ran Canetti, Daniel Shahaf, Margarita Vald
Universally Composable Authentication and Key-Exchange with Global PKI. Public Key Cryptography (2) (2016)
Ran Canetti, Justin Holmgren
Fully Succinct Garbled RAM. ITCS (2016)
Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova
Adaptive Succinct Garbled RAM or: How to Delegate Your Database. TCC (B2) (2016)
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45 (5) (2016)
Ran Canetti, Oxana Poburinnaya, Mariana Raykova
Optimal-Rate Non-Committing Encryption in a CRS Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Ran Canetti, Oxana Poburinnaya
Better Two-Round Adaptive Multiparty Computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Ran Canetti, Yilei Chen, Leonid Reyzin
On the Correlation Intractability of Obfuscated Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2015 (2015)
Charalampos Mavroforakis, Nathan Chenette, Adam O'Neill, George Kollios, Ran Canetti
Modular Order-Preserving Encryption, Revisited. SIGMOD Conference (2015)
Ran Canetti, Justin Holmgren
Fully Succinct Garbled RAM. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Canetti, Asaf Cohen, Yehuda Lindell
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. CRYPTO (2) (2015)
Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation. TCC (2) (2015)
Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan
Obfuscation of Probabilistic Circuits and Applications. TCC (2) (2015)
Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Obfuscation with Random Oracles. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Canetti, Vipul Goyal, Abhishek Jain
Concurrent Secure Computation with Optimal Query Complexity. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Obfuscation with Random Oracles. TCC (2) (2015)
Ran Canetti, Vipul Goyal, Abhishek Jain
Concurrent Secure Computation with Optimal Query Complexity. CRYPTO (2) (2015)
Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova
Succinct Adaptive Garbled RAM. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. STOC (2015)
Ran Canetti, Asaf Cohen, Yehuda Lindell
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Ran Canetti, Abhishek Jain, Omer Paneth
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity. IACR Cryptol. ePrint Arch. 2014 (2014)
Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin
Key Derivation From Noisy Sources With More Errors Than Entropy. IACR Cryptol. ePrint Arch. 2014 (2014)
Nir Bitansky, Ran Canetti
On Strong Simulation and Composable Point Obfuscation. J. Cryptol. 27 (2) (2014)
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014 (2014)
Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya
Adaptively Secure Two-party Computation From Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014 (2014)
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)

Ran Canetti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ran Canetti