Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Canetti, Ran"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Nir Bitansky
,
Ran Canetti
,
Alessandro Chiesa
,
Eran Tromer
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 111-120
Refereed delegation of computation
Ran Canetti
,
Ben Riva
,
Guy N. Rothblum
Information and Computation
226
, 2013, pp. 16-36
Extractable perfectly one-way functions
Ran Canetti
,
Ronny Ramzi Dakdouk
Lecture Notes in Computer Science
5126
, 2008, pp. 449-460
How to protect yourself without perfect shredding
Ran Canetti
,
Dror Eiger
,
Shafi Goldwasser
,
Dah-Yoh Lim
Lecture Notes in Computer Science
5126
, 2008, pp. 511-523
Composable formal security analysis: Juggling soundness, simplicity and efficiency
Ran Canetti
Lecture Notes in Computer Science
5126
, 2008, pp. 1-13
Chosen-ciphertext security from identity-based encryption
Dan Boneh
,
Ran Canetti
,
Shai Halevi
,
Jonathan Katz
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1301-1328
The random oracle methodology, revisited
Ran Canetti
,
Oded Goldreich
,
Shai Halevi
Journal of the ACM
51
(4), 2004, pp. 557-594
Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds
Ran Canetti
,
Joe Kilian
,
Erez Petrank
,
Alon Rosen
SIAM Journal on Computing
32
(1), 2002-2003, pp. 1-47
Universally composable two-party and multi-party secure computation
Ran Canetti
,
Yehuda Lindell
,
Rafail Ostrovsky
,
Amit Sahai
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 494-503
Black-box concurrent zero-knowledge requires
\tilde Omega(\log n)
rounds
Ran Canetti
,
Joe Kilian
,
Erez Petrank
,
Alon Rosen
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 570-579
Resettable zero-knowledge
Ran Canetti
,
Oded Goldreich
,
Shafi Goldwasser
,
Silvio Micali
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 235-244
Bandwidth allocation with preemption
Amotz Bar-Noy
,
Ran Canetti
,
Shay Kutten
,
Yishay Mansour
,
Baruch Schieber
SIAM Journal on Computing
28
(5), 1999, pp. 1806-1828
Secure computation with honest-looking parties: What if nobody is truly honest?
Ran Canetti
,
Rafail Ostrovsky
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 255-264
A modular approach to the design and analysis of authentication and key exchange protocols
Mihir Bellare
,
Ran Canetti
,
Hugo Krawczyk
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 419-428
The random oracle methodology, revisited
Ran Canetti
,
Oded Goldreich
,
Shai Halevi
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 209-218
Bounding the power of preemption in randomized scheduling
Ran Canetti
,
Sandy Irani
SIAM Journal on Computing
27
(4), 1998, pp. 993-1015
Perfectly one-way probabilistic hash functions
Ran Canetti
,
Daniele Micciancio
,
Omer Reingold
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 131-140
Pseudorandom functions revisited: The cascade construction and its concrete security
Mihir Bellare
,
Ran Canetti
,
Hugo Krawczyk
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 514-523
Adaptively secure multi-party computation
Ran Canetti
,
Uri Feige
,
Oded Goldreich
,
Moni Naor
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 639-648
Incoercible multiparty computation
Ran Canetti
,
Rosario Gennaro
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 504-513
More on BPP and the polynomial-time hierarchy
Ran Canetti
Information Processing Letters
57
(5), 1996, pp. 237-241
Bandwidth allocation with preemption
Amotz Bar-Noy
,
Ran Canetti
,
Shay Kutten
,
Yishay Mansour
,
Baruch Schieber
Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, May 29 - June 1, 1995)
, 1995, pp. 616-625
Lower bounds for sampling algorithms for estimating the average
Ran Canetti
,
Guy Even
,
Oded Goldreich
Information Processing Letters
53
, 1995, pp. 17-25
Bounding the power of preemption in randomized scheduling
Ran Canetti
,
Sandy Irani
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 606-615
Maintaining security in the presence of transient faults
Ran Canetti
,
Amir Herzberg
Lecture Notes in Computer Science
839
, 1994, pp. 425-438
Seiten 1
2
>