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
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c138]Ran Canetti, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein:
Towards General-Purpose Program Obfuscation via Local Mixing. TCC (4) 2024: 37-70- [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]