- Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based
- Combinatorialfeatureselectionproblems (Extendedabstract)
- Honest-VerifierStatisticalZero-Knowledge EqualsGeneralStatisticalZero-Knowledge
- A Complete Problem for Statistical Zero Knowledge Princeton University, Princeton, New Jersey
- MINIMIZING WIRELENGTH IN ZERO AND BOUNDED SKEW CLOCK TREES
- Founding Cryptography on Oblivious Transfer Efficiently
- Can Statistical Zero Knowledge be Made Non-interactive?
- Black-Box Accountable Authority Identity-Based Vipul Goyal
- 2554 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY 2005 The Smallest Grammar Problem
- Moses Charikar * Query Strategies for Priced Information
- Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
- New Notions of Security: Achieving Universal Composability
- Multiclass Learning, Boosting, and Error-Correcting Codes Venkatesan Guruswami'
- On the (Im)possibility of Cryptography with Imperfect Randomness Yevgeniy Dodis
- Cryptography from Anonymity Yuval Ishai
- Exposure-Resilient Functions and All-or-Nothing Ran Canetti1
- Robust Non-interactive Zero Knowledge Alfredo De Santis1
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Precise Concurrent Zero Knowledge Omkant Pandey1
- Perfect Non-interactive Zero Knowledge for NP Jens Groth , Rafail Ostrovsky , and Amit Sahai
- Computing on Encrypted Data (Extended Abstract)
- Pushing Disks Together--The Continuous-Motion Case Marshall Bern Amit Sahai *
- On Perfect and Adaptive Security in Exposure-Resilient Cryptography
- Secure Arithmetic Computation with No Honest Majority
- Many-to-One Trapdoor Functions and Their Relation to Public-Key Cryptosystems
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics
- Universally Composable Two-Party and Multi-party Secure Computation
- Concurrent Zero Knowledge with Logarithmic Round-Complexity Manoj Prabhakaran
- Fast Cryptographic Primitives and Circular-Secure Encryption
- Resettably Secure Computation Vipul Goyal and Amit Sahai
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Jens Groth1,
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Bounded Ciphertext Policy Attribute Based Vipul Goyal , Abhishek Jain , Omkant Pandey , and Amit Sahai
- Cryptography with Constant Computational Overhead Yuval Ishai
- Attribute-Based Encryption with Non-Monotonic Access Structures
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
- Covert Multi-party Computation Nishanth Chandran
- Ring Signatures of Sub-linear Size Without Random Nishanth Chandran, Jens Groth , and Amit Sahai
- Ciphertext-Policy Attribute-Based Encryption John Bethencourt
- Zero-Knowledge from Secure Multiparty Computation Yuval Ishai
- Non-interactive Zaps and New Techniques Jens Groth , Rafail Ostrovsky , and Amit Sahai
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Concurrent Zero Knowledge Without Complexity Assumptions
- Fuzzy Identity-Based Encryption Amit Sahai1,
- Positive Results and Techniques for Obfuscation Benjamin Lynn1
- Secure Protocols for Complex Tasks in Complex Environments
- Batch Codes and Their Applications Yuval Ishai
- Concurrent Zero-Knowledge CYNTHIA DWORK
- Receiver Anonymity via Incomparable Public Keys
- Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models
- "Soft-decision"Decoding of Chinese Remainder Codes Venkatesan Guruswami* Amit Sahai * t Madhu Sudan * 3
- Minimizing wirelength in zero andboundedskew clock trees Moses Charikar* Jon Kleinbergt Ravi Kumati Sridhar Rajagopalan' Amit Sahais
- The Power of a Pebble: Exploring and Mapping Directed Graphs
- Discrete Comput Geom 20:499514 (1998) Discrete & Computational Geometry 1998 Springer-Verlag New York Inc.
- A CompletePromiseProblemfor Statistical Zero-Knowledge* Amit Sahait
- Concurrent Non-Malleable Zero Knowledge Department of Computer Science
- Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data
- Information and Computation 176, 121 (2002) doi:10.1006/inco.2001.3081
- ForPeerReview On the (Im)possibility of Obfuscating Programs
- Private Locally Decodable Codes Rafail Ostrovsky, Omkant Pandey, and Amit Sahai
- Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints
- On the (Im)possibility of Obfuscating Programs (Extended Abstract)
- Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
- Authorized licensed use limited to: Univ of Calif Los Angeles. Downloaded on July 27, 2009 at 22:00 from IEEE Xplore. Restrictions apply. Authorized licensed use limited to: Univ of Calif Los Angeles. Downloaded on July 27, 2009 at 22:00 from IEEE Xplore.
- How To Play Almost Any Mental Game Over The Net --Concurrent Composition via Super-Polynomial Simulation
- Coding Constructions for Blacklisting Problems without Computational Assumptions
- Concurrent Zero-Knowledge Cynthia Dlvork* Moni Naori Amit sahai~
