Travelled to:1 × Denmark
1 × Iceland
1 × Latvia
1 × Poland
2 × Canada
7 × USA
Collaborated with:R.Ostrovsky M.Prabhakaran Y.Ishai E.Kushilevitz B.Waters O.Pandey S.P.Vadhan M.W.Bern A.Wadia N.Chandran J.Groth C.Dwork M.Naor O.Goldreich M.Charikar S.Garg C.Gentry V.Goyal A.Jain R.Canetti Y.Lindell D.Genkin E.Tromer M.A.Bender A.Fernández D.Ron R.Fagin V.Guruswami J.M.Kleinberg P.Raghavan X.Li D.Zuckerman E.Lehman D.Liu R.Panigrahy A.Rasala A.Shelat
Talks about:comput (5) secur (5) knowledg (4) zero (4) encrypt (3) applic (3) without (2) univers (2) statist (2) compos (2)
Person: Amit Sahai
DBLP: Sahai:Amit
Contributed to:
2014
201420132013200820082007200720042002200019981996Wrote 19 papers:
- ICALP-v1-2014-PrabhakaranSW #using
- Secure Computation Using Leaky Tokens (MP, AS, AW), pp. 907–918.
- STOC-2014-GenkinIPST
- Circuits resilient to additive attacks with applications to secure computation (DG, YI, MP, AS, ET), pp. 495–504.
- STOC-2014-SahaiW #encryption #how #obfuscation
- How to use indistinguishability obfuscation: deniable encryption, and more (AS, BW), pp. 475–484.
- ICALP-v1-2013-IshaiKLOPSZ #generative #pseudo #robust
- Robust Pseudorandom Generators (YI, EK, XL, RO, MP, AS, DZ), pp. 576–588.
- STOC-2013-GargGSW #encryption
- Witness encryption and its applications (SG, CG, AS, BW), pp. 467–476.
- ICALP-C-2008-GoyalJPS #bound #encryption #policy
- Bounded Ciphertext Policy Attribute Based Encryption (VG, AJ, OP, AS), pp. 579–591.
- STOC-2008-IshaiKOS #constant #encryption
- Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.
- ICALP-2007-ChandranGS #random
- Ring Signatures of Sub-linear Size Without Random Oracles (NC, JG, AS), pp. 423–434.
- ICALP-2007-OstrovskyPS
- Private Locally Decodable Codes (RO, OP, AS), pp. 387–398.
- STOC-2007-IshaiKOS #multi
- Zero-knowledge from secure multiparty computation (YI, EK, RO, AS), pp. 21–30.
- STOC-2004-IshaiKOS
- Batch codes and their applications (YI, EK, RO, AS), pp. 262–271.
- STOC-2004-PrabhakaranS #security
- New notions of security: achieving universal composability without trusted setup (MP, AS), pp. 242–251.
- STOC-2002-CanettiLOS #composition #multi
- Universally composable two-party and multi-party secure computation (RC, YL, RO, AS), pp. 494–503.
- STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling
- Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
- STOC-2000-CharikarFGKRS #query
- Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
- STOC-1998-BenderFRSV #graph #power of
- The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
- STOC-1998-DworkNS #concurrent
- Concurrent Zero-Knowledge (CD, MN, AS), pp. 409–418.
- STOC-1998-GoldreichSV #statistics
- Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge (OG, AS, SPV), pp. 399–408.
- STOC-1996-BernS
- Pushing Disks Together — The Continuous-Motion Case (MWB, AS), pp. 119–125.