BibSLEIGH — Ran

Travelled to:

1 × Australia
1 × Canada
1 × Greece
2 × Iceland
9 × USA

Collaborated with:

O.Goldreich R.Ostrovsky N.Bitansky A.Rosen ∅ R.R.Dakdouk S.Goldwasser S.Irani T.Rabin M.Bellare H.Krawczyk S.Halevi D.Micciancio O.Reingold M.Ben-Or J.Holmgren A.Jain V.Vaikuntanathan O.Paneth A.Chiesa E.Tromer D.Eiger D.Lim Y.Lindell A.Sahai J.Kilian E.Petrank S.Micali U.Feige M.Naor C.Mavroforakis N.Chenette A.O'Neill G.Kollios A.Bar-Noy S.Kutten Y.Mansour B.Schieber

Talks about:

secur (5) comput (4) parti (4) function (3) perfect (3) way (3) one (3) preemption (2) asynchron (2) knowledg (2)

Person: Ran Canetti

DBLP: Canetti:Ran

Contributed to:

2015

2014

2013

2008

2002

2001

2000

1999

1998

1996

1995

1993

Wrote 19 papers:

SIGMOD-2015-MavroforakisCOK #composition #encryption #revisited: Modular Order-Preserving Encryption, Revisited (CM, NC, AO, GK, RC), pp. 763–777.
STOC-2015-CanettiH0V #obfuscation #ram #source code: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (RC, JH, AJ, VV), pp. 429–437.
STOC-2014-BitanskyCPR #on the: On the existence of extractable one-way functions (NB, RC, OP, AR), pp. 505–514.
STOC-2013-BitanskyCCT #composition #recursion: Recursive composition and bootstrapping for SNARKS and proof-carrying data (NB, RC, AC, ET), pp. 111–120.
ICALP-B-2008-Canetti #analysis #composition #performance #security: Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency (RC), pp. 1–13.
ICALP-C-2008-CanettiD: Extractable Perfectly One-Way Functions (RC, RRD), pp. 449–460.
ICALP-C-2008-CanettiEGL #how: How to Protect Yourself without Perfect Shredding (RC, DE, SG, DYL), pp. 511–523.
STOC-2002-CanettiLOS #composition #multi: Universally composable two-party and multi-party secure computation (RC, YL, RO, AS), pp. 494–503.
STOC-2001-CanettiKPR #black box #concurrent: Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
STOC-2000-CanettiGGM: Resettable zero-knowledge (RC, OG, SG, SM), pp. 235–244.
STOC-1999-CanettiO #question #what: Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (RC, RO), pp. 255–264.
STOC-1998-BellareCK #analysis #approach #authentication #composition #design #protocol: A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (MB, RC, HK), pp. 419–428.
STOC-1998-CanettiGH #random #revisited: The Random Oracle Methodology, Revisited (RC, OG, SH), pp. 209–218.
STOC-1998-CanettiMR #probability: Perfectly One-Way Probabilistic Hash Functions (RC, DM, OR), pp. 131–140.
STOC-1996-CanettiFGN #adaptation #multi: Adaptively Secure Multi-Party Computation (RC, UF, OG, MN), pp. 639–648.
STOC-1995-Bar-NoyCKMS: Bandwidth allocation with preemption (ABN, RC, SK, YM, BS), pp. 616–625.
STOC-1995-CanettiI #bound #power of #random #scheduling: Bounding the power of preemption in randomized scheduling (RC, SI), pp. 606–615.
STOC-1993-Ben-OrCG: Asynchronous secure computation (MBO, RC, OG), pp. 52–61.
STOC-1993-CanettiR #performance: Fast asynchronous Byzantine agreement with optimal resilience (RC, TR), pp. 42–51.