The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ran Canetti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth allocation with preemption. [Citation Graph (1, 0)][DBLP]
    STOC, 1995, pp:616-625 [Conf]
  2. William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis
    Efficient, DoS-resistant, secure key exchange for internet protocols. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:48-58 [Conf]
  3. Mihir Bellare, Ran Canetti, Hugo Krawczyk
    Keying Hash Functions for Message Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:1-15 [Conf]
  4. Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
    Secure Computation Without Authentication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:361-377 [Conf]
  5. Ran Canetti
    Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:455-469 [Conf]
  6. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
    Deniable Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:90-104 [Conf]
  7. Ran Canetti, Marc Fischlin
    Universally Composable Commitments. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:19-40 [Conf]
  8. Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin
    Adaptive Security for Threshold Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:98-115 [Conf]
  9. Ran Canetti, Amir Herzberg
    Maintaining Security in the Presence of Transient Faults. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:425-438 [Conf]
  10. Ran Canetti, Hugo Krawczyk
    Security Analysis of IKE's Signature-Based Key-Exchange Protocol. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:143-161 [Conf]
  11. Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen
    Relaxing Chosen-Ciphertext Security. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:565-582 [Conf]
  12. Ran Canetti, Tal Rabin
    Universal Composition with Joint State. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:265-281 [Conf]
  13. Ran Canetti, Shai Halevi, Michael Steiner
    Mitigating Dictionary Attacks on Password-Protected Local Storage. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:160-179 [Conf]
  14. Ran Canetti
    Universally Composable Signature, Certification, and Authentication. [Citation Graph (0, 0)][DBLP]
    CSFW, 2004, pp:219-0 [Conf]
  15. Andre Scedrov, Ran Canetti, Joshua D. Guttman, David Wagner, Michael Waidner
    Relating Cryptography and Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:111-114 [Conf]
  16. Helmut Scherzer, Ran Canetti, Paul A. Karger, Hugo Krawczyk, Tal Rabin, David C. Toll
    Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2003, pp:181-200 [Conf]
  17. Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
    On Adaptive vs. Non-adaptive Security of Multiparty Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:262-279 [Conf]
  18. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai
    Exposure-Resilient Functions and All-or-Nothing Transforms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:453-469 [Conf]
  19. Ran Canetti, Shafi Goldwasser
    An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:90-106 [Conf]
  20. Ran Canetti, Shai Halevi, Jonathan Katz
    A Forward-Secure Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:255-271 [Conf]
  21. Ran Canetti, Shai Halevi, Jonathan Katz
    Chosen-Ciphertext Security from Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:207-222 [Conf]
  22. Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
    Universally Composable Password-Based Key Exchange. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:404-421 [Conf]
  23. Ran Canetti, Hugo Krawczyk
    Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:453-474 [Conf]
  24. Ran Canetti, Hugo Krawczyk
    Universally Composable Notions of Key Exchange and Secure Channels. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:337-351 [Conf]
  25. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
    On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:68-86 [Conf]
  26. Ran Canetti, Tal Malkin, Kobbi Nissim
    Efficient Communication-Storage Tradeoffs for Multicast Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:459-474 [Conf]
  27. Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass
    Universally Composable Protocols with Relaxed Set-Up Assumptions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:186-195 [Conf]
  28. Mihir Bellare, Ran Canetti, Hugo Krawczyk
    Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:514-523 [Conf]
  29. Ran Canetti
    Universally Composable Security: A New Paradigm for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:136-145 [Conf]
  30. Ran Canetti, Oded Goldreich
    Bounds on Tradeoffs between Randomness and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:766-775 [Conf]
  31. Ran Canetti, Rosario Gennaro
    Incoercible Multiparty Computation (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:504-513 [Conf]
  32. Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
    Multicast Security: A Taxonomy and Some Efficient Constructions. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:708-716 [Conf]
  33. Ran Canetti, Catherine Meadows, Paul F. Syverson
    Environmental Requirements for Authentication Protocols. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:339-355 [Conf]
  34. Ran Canetti, Pau-Chen Cheng, Frederique Giraud, Dimitrios E. Pendarakis, Josyula R. Rao, Pankaj Rohatgi, Debanjan Saha
    An IPSec-based Host Architecture for Secure Internet Multicast. [Citation Graph (0, 0)][DBLP]
    NDSS, 2000, pp:- [Conf]
  35. Adrian Perrig, Ran Canetti, Dawn Xiaodong Song, J. D. Tygar
    Efficient and Secure Source Authentication for Multicast. [Citation Graph (0, 0)][DBLP]
    NDSS, 2001, pp:- [Conf]
  36. Ran Canetti, Shai Halevi, Amir Herzberg
    Maintaining Authenticated Communication in the Presence of Break-ins. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:15-24 [Conf]
  37. Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
    Selective private function evaluation with applications to private statistics. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:293-304 [Conf]
  38. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness vs. Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:35-44 [Conf]
  39. Alain Azagury, Ran Canetti, Michael Factor, Shai Halevi, Ealan Henis, Dalit Naor, Noam Rinetzky, Ohad Rodeh, Julian Satran
    A Two Layered Approach for Securing an Object Store Network. [Citation Graph (0, 0)][DBLP]
    IEEE Security in Storage Workshop, 2002, pp:10-23 [Conf]
  40. Adrian Perrig, Ran Canetti, J. D. Tygar, Dawn Xiaodong Song
    Efficient Authentication and Signing of Multicast Streams over Lossy Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2000, pp:56-73 [Conf]
  41. William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold
    Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2001, pp:27-39 [Conf]
  42. Mihir Bellare, Ran Canetti, Hugo Krawczyk
    A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:419-428 [Conf]
  43. Michael Ben-Or, Ran Canetti, Oded Goldreich
    Asynchronous secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:52-61 [Conf]
  44. Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor
    Adaptively Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:639-648 [Conf]
  45. Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
    Resettable zero-knowledge (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:235-244 [Conf]
  46. Ran Canetti, Oded Goldreich, Shai Halevi
    The Random Oracle Methodology, Revisited (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:209-218 [Conf]
  47. Ran Canetti, Sandy Irani
    Bounding the power of preemption in randomized scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:606-615 [Conf]
  48. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
    Black-box concurrent zero-knowledge requires Omega~(log n) rounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:570-579 [Conf]
  49. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai
    Universally composable two-party and multi-party secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:494-503 [Conf]
  50. Ran Canetti, Daniele Micciancio, Omer Reingold
    Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:131-140 [Conf]
  51. Ran Canetti, Rafail Ostrovsky
    Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:255-264 [Conf]
  52. Ran Canetti, Tal Rabin
    Fast asynchronous Byzantine agreement with optimal resilience. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:42-51 [Conf]
  53. Ran Canetti, Oded Goldreich, Shai Halevi
    On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:40-57 [Conf]
  54. Ran Canetti, Jonathan Herzog
    Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:380-403 [Conf]
  55. Ran Canetti, Shai Halevi, Jonathan Katz
    Adaptively-Secure, Non-interactive Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:150-168 [Conf]
  56. Ran Canetti, Shai Halevi, Michael Steiner
    Hardness Amplification of Weakly Verifiable Puzzles. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:17-33 [Conf]
  57. Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish
    Universally Composable Security with Global Setup. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:61-85 [Conf]
  58. Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala
    Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:238-253 [Conf]
  59. Ran Canetti, Oded Goldreich
    Bounds on Tradeoffs Between Randomness and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:141-167 [Journal]
  60. Ran Canetti, Oded Goldreich, Shai Halevi
    The Random Oracle Methodology, Revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  61. Ran Canetti
    A unified framework for analyzing security of protocols [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:16, pp:- [Journal]
  62. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
    Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:50, pp:- [Journal]
  63. Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
    Resettable Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:42, pp:- [Journal]
  64. Ran Canetti
    More on BPP and the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:237-241 [Journal]
  65. Ran Canetti, Guy Even, Oded Goldreich
    Lower Bounds for Sampling Algorithms for Estimating the Average. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:17-25 [Journal]
  66. Ran Canetti, Oded Goldreich, Shai Halevi
    The random oracle methodology, revisited. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:557-594 [Journal]
  67. Ran Canetti
    Security and Composition of Multiparty Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:143-202 [Journal]
  68. Ran Canetti
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:3, pp:187-189 [Journal]
  69. Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
    Adaptive versus Non-Adaptive Security of Multi-Party Protocols. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:3, pp:153-207 [Journal]
  70. Ran Canetti, Shai Halevi, Amir Herzberg
    Maintaining Authenticated Communication in the Presence of Break-Ins. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:61-105 [Journal]
  71. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
    On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:2, pp:135-167 [Journal]
  72. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness versus Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:107-142 [Journal]
  73. Ran Canetti, Sandy Irani
    Bounding the Power of Preemption in Randomized Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:993-1015 [Journal]
  74. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth Allocation with Preemption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1806-1828 [Journal]
  75. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
    Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:1-47 [Journal]
  76. Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz
    Chosen-Ciphertext Security from Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1301-1328 [Journal]
  77. William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold
    Just fast keying: Key agreement in a hostile internet. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst. Secur., 2004, v:7, n:2, pp:242-273 [Journal]
  78. Ran Canetti
    Obtaining Universally Compoable Security: Towards the Bare Bones of Trust. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:88-112 [Conf]
  79. Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
    Amplifying Collision Resistance: A Complexity-Theoretic Treatment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:264-283 [Conf]
  80. Ran Canetti, Shai Halevi, Jonathan Katz
    A Forward-Secure Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2007, v:20, n:3, pp:265-294 [Journal]

  81. Chosen-ciphertext secure proxy re-encryption. [Citation Graph (, )][DBLP]


  82. POSH: a generalized captcha with security applications. [Citation Graph (, )][DBLP]


  83. Modeling Computational Security in Long-Lived Systems. [Citation Graph (, )][DBLP]


  84. On Strong Simulation and Composable Point Obfuscation. [Citation Graph (, )][DBLP]


  85. Compositional Security for Task-PIOAs. [Citation Graph (, )][DBLP]


  86. Obfuscating Point Functions with Multibit Output. [Citation Graph (, )][DBLP]


  87. Cryptography from Sunspots: How to Use an Imperfect Reference String. [Citation Graph (, )][DBLP]


  88. Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency. [Citation Graph (, )][DBLP]


  89. How to Protect Yourself without Perfect Shredding. [Citation Graph (, )][DBLP]


  90. Extractable Perfectly One-Way Functions. [Citation Graph (, )][DBLP]


  91. Towards a Theory of Extractable Functions. [Citation Graph (, )][DBLP]


  92. Non-malleable Obfuscation. [Citation Graph (, )][DBLP]


  93. On Symmetric Encryption and Point Obfuscation. [Citation Graph (, )][DBLP]


  94. Obfuscation of Hyperplane Membership. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002