BibSLEIGH — Shafi

Travelled to:

1 × Iceland
1 × Japan
15 × USA
2 × Canada

Collaborated with:

O.Goldreich S.Micali Y.T.Kalai M.Bellare J.Kilian G.N.Rothblum M.Ben-Or A.Wigderson A.Akavia D.Moshkovitz ∅ R.Canetti C.Lund M.Sipser D.Gutfreund A.Healy T.Kaufman S.Park C.Rackoff A.C.Yao E.Boyle A.Jain D.Eiger D.Lim A.Russell A.Russeli R.A.Popa V.Vaikuntanathan N.Zeldovich

Talks about:

proof (6) interact (4) probabilist (3) function (3) approxim (3) comput (3) applic (3) coin (3) knowledg (2) checkabl (2)

Person: Shafi Goldwasser

DBLP: Goldwasser:Shafi

Contributed to:

2015

2013

2012

2010

2009

2008

2007

2006

2000

1998

1995

1994

1993

1988

1986

1985

1983

1982

Wrote 22 papers:

ICALP-v2-2015-GoldwasserKP #adaptation #revisited: Adaptively Secure Coin-Flipping, Revisited (SG, YTK, SP), pp. 663–674.
STOC-2013-GoldwasserKPVZ #encryption #functional #reuse: Reusable garbled circuits and succinct functional encryption (SG, YTK, RAP, VV, NZ), pp. 555–564.
STOC-2012-BoyleGJK #memory management #multi: Multiparty computation secure against continual memory leakage (EB, SG, AJ, YTK), pp. 1235–1254.
STOC-2010-AkaviaGGM #np-hard: Erratum for: on basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 795–796.
STOC-2009-Goldwasser #question #source code: Athena lecture: Controlling Access to Programs? (SG), pp. 167–168.
ICALP-C-2008-CanettiEGL #how: How to Protect Yourself without Perfect Shredding (RC, DE, SG, DYL), pp. 511–523.
STOC-2008-GoldwasserGHKR #approach: A (de)constructive approach to program checking (SG, DG, AH, TK, GNR), pp. 143–152.
STOC-2008-GoldwasserKR #interactive #proving: Delegating computation: interactive proofs for muggles (SG, YTK, GNR), pp. 113–122.
STOC-2007-GoldwasserGHKR #constant #verification: Verifying and decoding in constant depth (SG, DG, AH, TK, GNR), pp. 440–449.
STOC-2006-AkaviaGGM #np-hard #on the: On basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 701–710.
STOC-2000-CanettiGGM: Resettable zero-knowledge (RC, OG, SG, SM), pp. 235–244.
STOC-1998-GoldreichG #on the #problem: On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.
STOC-1995-BellareGG #encryption #incremental: Incremental cryptography and application to virus protection (MB, OG, SG), pp. 45–56.
STOC-1994-BellareGLR #approximate #performance #probability #proving: Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
STOC-1993-BellareGLR #approximate #performance #proving: Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
STOC-1988-Ben-OrGKW #how #interactive #multi #proving: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (MBO, SG, JK, AW), pp. 113–131.
STOC-1988-Ben-OrGW #distributed #fault tolerance #theorem: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (MBO, SG, AW), pp. 1–10.
STOC-1986-GoldwasserK: Almost All Primes Can Be Quickly Certified (SG, JK), pp. 316–329.
STOC-1986-GoldwasserS #interactive #proving: Private Coins versus Public Coins in Interactive Proof Systems (SG, MS), pp. 59–68.
STOC-1985-GoldwasserMR #complexity #interactive: The Knowledge Complexity of Interactive Proof-Systems (SG, SM, CR), pp. 291–304.
STOC-1983-GoldwasserMY: Strong Signature Schemes (SG, SM, ACCY), pp. 431–439.
STOC-1982-GoldwasserM #encryption #game studies #how #probability: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information (SG, SM), pp. 365–377.