| Year |
Citation |
Score |
| 2019 |
Canetti R, Stoughton A, Varia M. EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security Cell Structure and Function. 167-183. DOI: 10.1109/Csf.2019.00019 |
0.528 |
|
| 2018 |
Bitansky N, Canetti R, Garg S, Holmgren J, Jain A, Lin H, Pass R, Telang S, Vaikuntanathan V. Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings Siam Journal On Computing. 47: 1123-1210. DOI: 10.1137/15M1050963 |
0.368 |
|
| 2016 |
Bitansky N, Canetti R, Paneth O, Rosen A. On the Existence of Extractable One-Way Functions Siam Journal On Computing. 45: 1910-1952. DOI: 10.1137/140975048 |
0.656 |
|
| 2016 |
Canetti R, Lin H, Pass R. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions Siam Journal On Computing. 45: 1793-1834. DOI: 10.1137/110847196 |
0.523 |
|
| 2016 |
Asharov G, Canetti R, Hazay C. Toward a Game Theoretic View of Secure Computation Journal of Cryptology. 29: 879-926. DOI: 10.1007/S00145-015-9212-6 |
0.448 |
|
| 2014 |
Bitansky N, Canetti R. On Strong Simulation and Composable Point Obfuscation Journal of Cryptology. 27: 317-357. DOI: 10.1007/S00145-013-9146-9 |
0.406 |
|
| 2013 |
Canetti R, Riva B, Rothblum GN. Refereed delegation of computation Information & Computation. 226: 16-36. DOI: 10.1016/J.Ic.2013.03.003 |
0.457 |
|
| 2011 |
Barak B, Canetti R, Lindell Y, Pass R, Rabin T. Secure Computation Without Authentication Journal of Cryptology. 24: 720-760. DOI: 10.1007/S00145-010-9075-9 |
0.707 |
|
| 2011 |
Canetti R, Herzog J. Universally Composable Symbolic Security Analysis Journal of Cryptology. 24: 83-147. DOI: 10.1007/S00145-009-9055-0 |
0.459 |
|
| 2008 |
Canetti R, Cheung L, Kaynar D, Liskov M, Lynch N, Pereira O, Segala R. Analyzing security protocols using time-bounded task-PIOAs Discrete Event Dynamic Systems: Theory and Applications. 18: 111-159. DOI: 10.1007/S10626-007-0032-1 |
0.494 |
|
| 2007 |
Canetti R, Halevi S, Katz J. A Forward-Secure Public-Key Encryption Scheme Journal of Cryptology. 20: 265-294. DOI: 10.1007/S00145-006-0442-5 |
0.463 |
|
| 2006 |
Canetti R. Security and composition of cryptographic protocols: a tutorial (part I) Sigact News. 37: 67-92. DOI: 10.1145/1165555.1165570 |
0.476 |
|
| 2006 |
Boneh D, Canetti R, Halevi S, Katz J. Chosen-Ciphertext Security from Identity-Based Encryption Siam Journal On Computing. 36: 1301-1328. DOI: 10.1137/S009753970544713X |
0.451 |
|
| 2006 |
Canetti R, Kushilevitz E, Lindell Y. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions Journal of Cryptology. 19: 135-167. DOI: 10.1007/S00145-005-0419-9 |
0.717 |
|
| 2004 |
Aiello W, Bellovin SM, Blaze M, Canetti R, Ioannidis J, Keromytis AD, Reingold O. Just fast keying: Key agreement in a hostile internet Acm Transactions On Information and System Security. 7: 242-273. DOI: 10.1145/996943.996946 |
0.444 |
|
| 2004 |
Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited Journal of the Acm. 51: 557-594. DOI: 10.1145/1008731.1008734 |
0.641 |
|
| 2004 |
Canetti R, Damgard I, Dziembowski S, Ishai Y, Malkin T. Adaptive versus Non-Adaptive Security of Multi-Party Protocols Journal of Cryptology. 17: 153-207. DOI: 10.1007/S00145-004-0135-X |
0.479 |
|
| 2003 |
Canetti R, Kilian J, Petrank E, Rosen A. Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds Siam Journal On Computing. 32: 1-47. DOI: 10.1137/S0097539701392949 |
0.673 |
|
| 2000 |
Canetti R. Security and Composition of Multiparty Cryptographic Protocols Journal of Cryptology. 13: 143-202. DOI: 10.1007/S001459910006 |
0.478 |
|
| 2000 |
Canetti R, Kushilevitz E, Ostrovsky R, Rosén A. Randomness versus Fault-Tolerance Journal of Cryptology. 13: 107-142. DOI: 10.1007/S001459910005 |
0.379 |
|
| 2000 |
Canetti R, Halevi S, Herzberg A. Maintaining Authenticated Communication in the Presence of Break-Ins Journal of Cryptology. 13: 61-105. DOI: 10.1007/S001459910004 |
0.381 |
|
| 1999 |
Canetti R, Friedlander J, Shparlinski I. On Certain Exponential Sums and the Distribution of Diffie–Hellman Triples Journal of the London Mathematical Society-Second Series. 59: 799-812. DOI: 10.1112/S002461079900736X |
0.31 |
|
| 1998 |
Canetti R, Irani S. Bounding the power of preemption in randomized scheduling Siam Journal On Computing. 27: 993-1015. DOI: 10.1137/S0097539795283292 |
0.33 |
|
| 1996 |
Canetti R. More on BPP and the polynomial-time hierarchy Information Processing Letters. 57: 237-241. DOI: 10.1016/0020-0190(96)00016-6 |
0.312 |
|
| 1995 |
Canetti R, Even G, Goldreich O. Lower bounds for sampling algorithms for estimating the average Information Processing Letters. 53: 17-25. DOI: 10.1016/0020-0190(94)00171-T |
0.571 |
|
| 1993 |
Canetti R, Goldreich O. Bounds on tradeoffs between randomness and communication complexity Computational Complexity. 3: 141-167. DOI: 10.1007/Bf01200118 |
0.598 |
|
| Show low-probability matches. |