BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Canetti R, Stoughton A, Varia M. (2019) EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security Cell Structure and Function. 167-183 |
| Bitansky N, Canetti R, Garg S, et al. (2018) Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings Siam Journal On Computing. 47: 1123-1210 |
| Bitansky N, Canetti R, Paneth O, et al. (2016) On the Existence of Extractable One-Way Functions Siam Journal On Computing. 45: 1910-1952 |
| Canetti R, Lin H, Pass R. (2016) Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions Siam Journal On Computing. 45: 1793-1834 |
| Asharov G, Canetti R, Hazay C. (2016) Toward a Game Theoretic View of Secure Computation Journal of Cryptology. 29: 879-926 |
| Bitansky N, Canetti R. (2014) On Strong Simulation and Composable Point Obfuscation Journal of Cryptology. 27: 317-357 |
| Canetti R, Riva B, Rothblum GN. (2013) Refereed delegation of computation Information & Computation. 226: 16-36 |
| Barak B, Canetti R, Lindell Y, et al. (2011) Secure Computation Without Authentication Journal of Cryptology. 24: 720-760 |
| Canetti R, Herzog J. (2011) Universally Composable Symbolic Security Analysis Journal of Cryptology. 24: 83-147 |
| Canetti R, Cheung L, Kaynar D, et al. (2008) Analyzing security protocols using time-bounded task-PIOAs Discrete Event Dynamic Systems: Theory and Applications. 18: 111-159 |