Research and Publications
Please email me for
further details regarding any of the papers below.
To Appear:
"On the (Im)possibility of Obfuscating Programs" (with Boaz Barak,
Oded Goldreich, Russell Impagliazzo, Steven Rudich, Salil Vadhan, and Ke
Yang). Journal of the ACM. (accepted pending minor revision)
[pdf]
ÒResolving the Simultaneous Resettability Conjecture and a
New Non-Black-Box Simulation StrategyÓ (with Yi Deng and Vipul Goyal). Proceedings of FOCS 2009. (to appear)
ÒExtracting CorrelationsÓ (with Yuval Ishai, Eyal
Kushilevtiz, and Rafail Ostrovsky).
Proceedings of FOCS 2009. (to appear)
2009
"Zero-Knowledge from Secure Multiparty Computation" (with Yuval Ishai,
Eyal Kushilevitz, and Rafail Ostrovsky). SIAM Journal on Computing,
Special Issue for STOC 2007. Volume 39, Issue 3, pp. 1121-1152 (2009)
[pdf]
ÒFast Cryptographic Primitives and Circular-Secure
Encryption Based on Hard Learning ProblemsÓ (with Benny Applebaum, David Cash,
and Chris Peikert). Proceedings of CRYPTO 2009.
[pdf]
ÒResettably Secure ComputationÓ
(with Vipul Goyal). Proceedings of Proceedings of EUROCRYPT 2009.
ÒSecure Arithmetic Computation
with No Honest MajorityÓ (with Yuval Ishai and Manoj Prabhakaran). Proceedings
of TCC 2009.
[pdf]
2008
ÒBlack-Box Accountable Authority Identity-Based EncryptionÓ
(with Vipul Goyal, Steve Lu, and Brent Waters). Proceedings of ACM Conference
on Computer and Communications Security, 2008.
ÒFounding Cryptography on
Oblivious Transfer—EfficientlyÓ (with Yuval Ishai and Manoj Prabhakaran).
Proceedings of CRYPTO 2008.
ÒPredicate Encryption Supporting
Disjunctions, Polynomial Equations, and Inner ProductsÓ (with Jonathan Katz and
Brent Waters). Proceedings of EUROCRYPT 2008.
ÒPrecise Concurrent Zero
KnowledgeÓ (with Omkant Pandey, Rafael Pass, Wei-Lung Dustin Tseng, and Muthuramakrishnan
Venkitasubramaniam). Proceedings of EUROCRYPT 2008.
ÒEfficient Non-interactive Proof
Systems for Bilinear GroupsÓ (with Jens Groth). Proceedings of EUROCRYPT 2008.
ÒNew Constructions for UC Secure
Computation Using Tamper-Proof HardwareÓ (with Nishanth Chandran and Vipul
Goyal). Proceedings of EUROCRYPT
2008.
ÒBounded Ciphertext Policy
Attribute Based EncryptionÓ (with Vipul Goyal, Abhishek Jain, and Omkant Pandey).
Proceedings of ICALP 2008.
ÒComputing on Encrypted DataÓ. Invited
Talk and Paper. Proceedings of ICISS 2008.
ÒCryptography with Constant
Computational OverheadÓ (with Yuval Ishai, Eyal Kushilevitz, and Rafail
Ostrovsky). Proceedings of STOC 2008.
ÒImproved Algorithms for Optimal
EmbeddingsÓ (with Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant
Pandey, and Mohammad Ali Safari). ACM Transactions on Algorithms 4(4), 2008.
2007
ÒAttribute-Based Encryption with
Non-Monotonic Access StructuresÓ (with Rafail Ostrovsky and Brent Waters).
Proceedings of ACM Conference on Computer and Communications Security, 2007.
ÒConcurrent Statistical
Zero-Knowledge Arguments for NP from One Way FunctionsÓ (with Vipul Goyal, Ryan
Moriarty, and Rafail Ostrovsky). Proceedings of ASIACRYPT 2007.
ÒCovert Multi-Party ComputationÓ
(with Nishanth Chandran, Vipul Goyal, and Rafail Ostrovsky). Proceedings of FOCS
2007.
ÒPrivate Locally Decodable CodesÓ
(with Rafail Ostrovsky and Omkant Pandey). Proceedings of ICALP 2007.
ÒRing Signatures of Sub-linear
Size Without Random OraclesÓ (with Nishanth Chandran and Jens Groth). Proceedings
of ICALP 2007.
ÒCiphertext-Policy Attribute-Based
EncryptionÓ (with John Bethencourt and Brent Waters). Proceedings of IEEE
Symposium on Security and Privacy, 2007.
ÒZero-Knowledge from Secure
Multiparty ComputationÓ (with Yuval Ishai, Eyal Kushilevitz, and Rafail
Ostrovsky). Proceedings of STOC 2007.
2006
ÒAttribute-Based Encryption for Fine-Grained Access Control
of Encrypted DataÓ (with Vipul Goyal, Omkant Pandey, and Brent Waters). Proceedings of ACM Conference on Computer
and Communications Security, 2006.
ÒNon-Interactive Zaps and New
Techniques for NIZKÓ (with Jens Groth and
Rafail Ostrovsky). Proceedings of CRYPTO 2006.
ÒPrivate Circuits II: Keeping
Secrets in Tamperable CircuitsÓ (with Yuval Ishai, Manoj Prabhakaran, and David Wagner). Proceedings of EUROCRYPT
2006.
ÒPerfect Non-interactive Zero Knowledge
for NPÓ (with Jens Groth and Rafail Ostrovsky). Proceedings of EUROCRYPT 2006.
ÒSequential Aggregate Signatures
and Multisignatures Without Random OraclesÓ (with Steve Lu, Rafail
Ostrovsky, Hovav Shacham, and
Brent Waters). Proceedings of EUROCRYPT 2006.
ÒFully Collusion Resistant Traitor
Tracing with Short Ciphertexts and Private KeysÓ (with Dan Boneh and Brent
Waters). Proceedings of EUROCRYPT 2006.
ÒCryptography from AnonymityÓ
(with Yuval Ishai, Eyal Kushilevitz, and Rafail Ostrovsky). Proceedings of FOCS 2006.
ÒConcurrent Non-Malleable Zero
KnowledgeÓ (with Boaz Barak and Manoj Prabhakaran). Proceedings of FOCS 2006.
ÒConcurrent Zero Knowledge Without
Complexity AssumptionsÓ (with Daniele Micciancio, Shien Jin Ong, and Salil Vadhan). Proceedings of TCC
2006.
2005
ÒFuzzy Identity-Based EncryptionÓ
(with Amit Sahai and Brent Waters). Proceedings of EUROCRYPT 2005.
ÒHow To Play Almost Any Mental
Game Over The Net - Concurrent Composition via Super-Polynomial SimulationÓ
(with Boaz Barak). Proceedings of FOCS 2005.
ÒRelaxing Environmental Security:
Monitored Functionalities and Client-Server ComputationÓ (with Manoj
Prabhakaran). Proceedings of TCC
2005.
ÒThe Smallest Grammar ProblemÓ
(with Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, and Abhi Shelat). IEEE Transactions on
Information Theory 51(7), 2005.
2004
ÒPositive Results and Techniques for
ObfuscationÓ (with Ben Lynn and Manoj Prabhakaran). Proceedings of EUROCRYPT
2004.
ÒOn the (Im)possibility of
Cryptography with Imperfect RandomnessÓ (with Yevgeniy Dodis, Shien Jin Ong, and
Manoj Prabhakaran). Proceedings of FOCS 2004.
ÒSecure Protocols for Complex
Tasks in Complex EnvironmentsÓ Invited Talk and Paper. Proceedings of INDOCRYPT 2004.
ÒFrugality in Path AuctionsÓ (with
Edith Elkind and Kenneth
Steiglitz). Proceedings of SODA
2004.
ÒNew Notions of Security:
Achieving Universal Composability Without Trusted SetupÓ (with Manoj
Prabhakaran). Proceedings of STOC
2004.
ÒBatch Codes and Their
ApplicationsÓ (with Yuval Ishai, Eyal Kushilevitz, and Rafail Ostrovsky).
Proceedings of STOC 2004.
ÒConcurrent Zero-KnowledgeÓ (with
Cynthia Dwork and Moni Naor). Journal of the ACM 51(6), 2004.
ÒMinimizing Wirelength in Zero and
Bounded Skew Clock TreesÓ (with Moses Charikar, Jon M. Proceedings of Kleinberg,
Ravi Kumar, Sridhar Rajagopalan,
and Andrew Tomkins). SIAM J. Proceedings of Discrete Math. 17(4), 2004.
2003
Approximation, Randomization, and
Combinatorial Optimization: Algorithms and Techniques (with Sanjeev Arora, Klaus
Jansen, and JosŽ D. Rolim, editors). Proceedings of 6th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems, (APPROX) 2003, and 7th International
Workshop on Randomization and Approximation Techniques in Computer Science, (RANDOM)
2003.
ÒReceiver Anonymity via
Incomparable Public KeysÓ (with Brent Waters and Edward Felten). Proceedings of
ACM Conference on Computer and
Communications Security, 2003.
ÒPrivate Circuits: Securing
Hardware against Probing AttacksÓ (with Yuval Ishai and David Wagner).
Proceedings of CRYPTO 2003.
ÒA Complete Problem for
Statistical Zero KnowledgeÓ (with Salil Vadhan). Journal of the ACM 50(2),
2003.
2002
ÒConcurrent Zero Knowledge with
Logarithmic Round-ComplexityÓ (with Manoj Prabhakaran and Alon Rosen).
Proceedings of FOCS 2002.
ÒDimension Reduction in the \ell
_1 NormÓ (with Moses Charikar). Proceedings of FOCS 2002.
ÒUniversally Composable Two-Party
and Multi-Party Secure ComputationÓ (with Ran Canetti, Yehuda Lindell, and Rafail
Ostrovsky). Proceedings of STOC 2002.
[pdf] Full version available here: [pdf]
ÒApproximating the smallest
grammar: Kolmogorov complexity in natural modelsÓ (with Moses Charikar, Eric
Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, and abhi shelat). Proceedings of STOC 2002.
ÒThe Power of a Pebble: Exploring
and Mapping Directed GraphsÓ (with Michael Bender, Antonio Fern‡ndez, Dana
Ron, and Salil Vadhan). Information and Computation 176(1),
2002.
ÒQuery Strategies for Priced
InformationÓ (with Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon
Kleinberg, and Prabhakar Raghavan). JCSS 64(4), 2002.
2001
ÒOn the (Im)possibility of
Obfuscating ProgramsÓ (with Boaz Barak, Oded Goldreich, Russell Impagliazzo,
Steven Rudich, Salil Vadhan, and Ke Yang). Proceedings of CRYPTO 2001.
[pdf] Full version available here: [pdf]
ÒRobust Non-interactive Zero
KnowledgeÓ (with Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, and
Giuseppe Persiano). Proceedings of CRYPTO 2001.
ÒOn Perfect and Adaptive Security
in Exposure-Resilient CryptographyÓ (with Yevgeniy Dodis and Adam Smith).
Proceedings of EUROCRYPT 2001.
2000
ÒExposure-Resilient Functions and
All-or-Nothing TransformsÓ (with Ran Canetti, Yevgeniy Dodis, Shai Halevi and
Eyal Kushilevitz). Proceedings of EUROCRYPT 2000.
"Soft-Decision Decoding of
Chinese Remainder CodesÓ (with Venkatesan Guruswami and Madhu Sudan). Proceedings of FOCS 2000.
ÒCombinatorial Feature Selection
ProblemsÓ (with Moses Charikar, Venkatesan Guruswami, Ravi Kumar, and Sridhar
Rajagopalan). Proceedings of FOCS
2000.
ÒQuery Strategies for Priced
InformationÓ (with Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon
Kleinberg, and Prabhakar Raghavan). Proceedings of STOC 2000.
1999
ÒMulticlass Learning, Boosting,
and Error-Correcting CodesÓ (with Venkatesan Guruswami). Proceedings of COLT 1999.
ÒCan Statistical Zero Knowledge Be
Made Non-interactive? or On the Relationship of SZK and NISZKÓ (with Oded
Goldreich and Salil Vadhan). Proceedings of CRYPTO 1999.
ÒNon-Malleable Encryption:
Equivalence between Two Notions, and an Indistinguishability-Based CharacterizationÓ
(with Mihir Bellare). Proceedings of CRYPTO 1999.
ÒCoding Constructions for
Blacklisting Problems Without Computational AssumptionsÓ (with Ravi Kumar and
Sridhar Rajagopalan). Proceedings of CRYPTO 1999.
ÒNon-Malleable Non-Interactive
Zero Knowledge and Adaptive Chosen-Ciphertext SecurityÓ. Proceedings of FOCS
1999.
ÒMinimizing Wirelength in Zero and
Bounded Skew Clock TreesÓ (with Moses Charikar, Jon Kleinberg, Ravi Kumar,
Sridhar Rajagopalan, and Andrew
Tomkins). Proceedings of SODA 1999.
ÒPseudonym SystemsÓ (with Anna
Lysyanskaya, Ronald Rivest, and
Stefan Wolf). Proceedings of Selected Areas in Cryptography, 1999.
1998
ÒMany-to-One Trapdoor Functions
and Their Ralation to Public-Key CryptosystemsÓ (with Mihir Bellare, Shai
Halevi, and Salil Vadhan). Proceedings of CRYPTO 1998.
ÒConcurrent Zero-Knowledge:
Reducing the Need for Timing ConstraintsÓ (with Cynthia Dwork). Proceedings of CRYPTO
1998.
ÒThe Power of a Pebble: Exploring
and Mapping Directed GraphsÓ (with Michael Bender, Antonio Fern‡ndez, Dana
Ron, and Salil Vadhan). Proceedings of STOC 1998.
ÒHonest-Verifier Statistical
Zero-Knowledge Equals General Statistical Zero-KnowledgeÓ (with Oded Goldreich
and Salil Vadhan). Proceedings of STOC 1998.
ÒConcurrent Zero-KnowledgeÓ (with
Cynthia Dwork and Moni Naor). Proceedings of STOC 1998.
ÒPushing Disks Together - The
Continuous-Motion CaseÓ (with Marshall Bern). Discrete & Computational
Geometry 20(4), 1998.
1997
ÒA Complete Promise Problem for
Statistical Zero-KnowledgeÓ (with Salil Vadhan). Proceedings of FOCS 1997.
1996
ÒPushing Disks Together - The
Continuous-Motion CaseÓ (with Marshall Bern). Proceedings of STOC 1996.