Research output per year
Research output per year
- 19 results
Search results
-
2008
08491 Executive Summary Theoretical Foundations of Practical Information Security
Canetti, R., Goldwasser, S., Müller, G. & Steinwandt, R., 2008, In: Dagstuhl Seminar Proceedings. 8491Research output: Contribution to journal › Conference article › peer-review
-
Modeling Computational Security in Long-Lived Systems, Version 2
Canetti, R., Cheung, L., Kaynar, D., Lynch, N. & Pereira, O., 2008, In: Dagstuhl Seminar Proceedings. 8491Research output: Contribution to journal › Conference article › peer-review
-
2005
Adaptively-secure, non-interactive public-key encryption
Canetti, R., Halevi, S. & Katz, J., 2005, In: Lecture Notes in Computer Science. 3378, p. 150-168 19 p.Research output: Contribution to journal › Conference article › peer-review
Open Access44 Scopus citations -
Hardness amplification of weakly verifiable puzzles
Canetti, R., Halevi, S. & Steiner, M., 2005, In: Lecture Notes in Computer Science. 3378, p. 17-33 17 p.Research output: Contribution to journal › Conference article › peer-review
Open Access49 Scopus citations -
Universally composable password-based key exchange
Canetti, R., Halevi, S., Katz, J., Lindell, Y. & MacKenzie, P., 2005, In: Lecture Notes in Computer Science. 3494, p. 404-421 18 p.Research output: Contribution to journal › Conference article › peer-review
Open Access185 Scopus citations -
2004
Universally composable protocols with relaxed set-up assumptions
Barak, B., Canetti, R., Nielsen, J. B. & Pass, R., 2004, In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 186-195 10 p.Research output: Contribution to journal › Conference article › peer-review
150 Scopus citations -
Universally composable signature, certification, and authentication
Canetti, R., 2004, In: Proceedings of the Computer Security Foundations Workshop. 17, p. 219-233 15 p.Research output: Contribution to journal › Conference article › peer-review
166 Scopus citations -
2002
Efficient, DoS-resistant, secure key exchange for internet protocols
Aiello, W., Bellovin, S. M., Blaze, M., Canetti, R., Ioannidis, J., Keromytis, A. D. & Reingold, O., 2002, In: Proceedings of the ACM Conference on Computer and Communications Security. p. 48-58 11 p.Research output: Contribution to journal › Conference article › peer-review
Open Access78 Scopus citations -
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R. & Sahai, A., 2002, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 494-503 10 p.Research output: Contribution to journal › Conference article › peer-review
506 Scopus citations -
2001
Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds
Canetti, R., Kilian, J., Petrank, E. & Rosen, A., 2001, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 570-579 10 p.Research output: Contribution to journal › Conference article › peer-review
96 Scopus citations -
Relating cryptography and cryptographic protocols: A panel
Scedrov, A., Canetti, R., Guttman, J., Wagner, D. & Waidner, M., 2001, In: Proceedings of the Computer Security Foundations Workshop. p. 111 1 p.Research output: Contribution to journal › Conference article › peer-review
1 Scopus citations -
Universally composable security: A new paradigm for cryptographic protocols
Canetti, R., 2001, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 136-145 10 p.Research output: Contribution to journal › Conference article › peer-review
Open Access2111 Scopus citations -
1999
Secure computation with honest-looking parties: What if nobody is truly honest?
Canetti, R. & Ostrovsky, R., 1999, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 255-264 10 p.Research output: Contribution to journal › Conference article › peer-review
23 Scopus citations -
1998
Modular approach to the design and analysis of authentication and key exchange protocols
Bellare, M., Canetti, R. & Krawczyk, H., 1998, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 419-428 10 p.Research output: Contribution to journal › Conference article › peer-review
406 Scopus citations -
Perfectly one-way probabilistic hash functions
Canetti, R., Micciancio, D. & Reingold, O., 1998, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 131-140 10 p.Research output: Contribution to journal › Conference article › peer-review
111 Scopus citations -
Random oracle methodology, revisited
Canetti, R., Goldreich, O. & Halevi, S., 1998, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 209-218 10 p.Research output: Contribution to journal › Conference article › peer-review
606 Scopus citations -
1996
Incoercible multiparty computation
Canetti, R. & Gennaro, R., 1996, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 504-513 10 p.Research output: Contribution to journal › Conference article › peer-review
61 Scopus citations -
Pseudorandom functions revisited: The cascade construction and its concrete security
Bellare, M., Canetti, R. & Krawczyk, H., 1996, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 514-523 10 p.Research output: Contribution to journal › Conference article › peer-review
138 Scopus citations -
1990
Bounds on tradeoffs between randomness and communication complexity
Canetti, R. & Goldreich, O., 1990, In: Annual Symposium on Foundations of Computer Science - Proceedings. 2, p. 766-775 10 p.Research output: Contribution to journal › Conference article › peer-review
5 Scopus citations