A5103835895- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Cryptographic Implementations and Security
- Privacy-Preserving Technologies in Data
- Chaos-based Image/Signal Encryption
- Coding theory and cryptography
- Internet Traffic Analysis and Secure E-voting
- Security and Verification in Computing
- Advanced Authentication Protocols Security
- Blockchain Technology Applications and Security
- Cryptography and Residue Arithmetic
- Distributed systems and fault tolerance
- Computability, Logic, AI Algorithms
- graph theory and CDMA systems
- Wireless Communication Security Techniques
- Physical Unclonable Functions (PUFs) and Hardware Security
- Logic, Reasoning, and Knowledge
- Adversarial Robustness in Machine Learning
- Algorithms and Data Compression
- Cloud Data Security Solutions
- Cooperative Communication and Network Coding
- Quantum Computing Algorithms and Architecture
- Geometric and Algebraic Topology
- Access Control and Trust
- Security in Wireless Sensor Networks
UCLA Health
2015-2024
University of California, Los Angeles
2014-2023
University of Southern California
2023
Rutgers Sexual and Reproductive Health and Rights
2023
UC San Diego Health System
2023
University of California, Berkeley
1996-2023
Weizmann Institute of Science
1999-2023
Princeton University
2000-2016
University of California System
2012-2015
Massachusetts Institute of Technology
1998-2002
As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt at these sites. One drawback of encrypting data, that it can selectively only coarse-grained level (i.e., giving another party your private key). We develop new cryptosystem for fine-grained sharing encrypted we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are labeled with sets attributes keys associated access structures control which...
In several distributed systems a user should only be able to access data if posses certain set of credentials or attributes. Currently, the method for enforcing such policies is employ trusted server store and mediate control. However, any storing compromised, then confidentiality will compromised. this paper we present system realizing complex control on encrypted that call ciphertext-policy attribute-based encryption. By using our techniques can kept confidential even storage untrusted;...
In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability requires that given any two equivalent circuits C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> of similar size, the obfuscations should be computationally indistinguishable. encryption, cipher texts encrypt inputs x keys are issued C. Using key SK...
We construct an Attribute-Based Encryption (ABE) scheme that allows a user's private key to be expressed in terms of any access formula over attributes. Previous ABE schemes were limited expressing only monotonic structures. provide proof security for our based on the Decisional Bilinear Diffie-Hellman (BDH) assumption. Furthermore, performance new compares favorably with existing, less-expressive schemes.
We show how to securely realize any multi-party functionality in a universally composable way, regardless of the number corrupted participants. That is, we consider network with open communication and an adversary that can adaptively corrupt as many parties it wishes. In this setting, our protocols allow subset (with pairs being special case) desired their local inputs, be guaranteed security is preserved activity rest network. This implies under concurrent composition unbounded protocol...
We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. use this technique carry out systematic study of the applicability variety goals. Along way, resolve 16-year-old open question Deniable Encryption, posed by Canetti, Dwork, Naor, and Ostrovsky in 1997: In deniable encryption, sender who is forced reveal an adversary both her message randomness she used for encrypting it should be able convincingly provide...
Informally, an obfuscator O is (efficient, probabilistic) “compiler” that takes as input a program (or circuit) P and produces new ( ) has the same functionality yet “unintelligible” in some sense. Obfuscators, if they exist, would have wide variety of cryptographic complexity-theoretic applications, ranging from software protection to homomorphic encryption analogues Rice's theorem. Most these applications are based on interpretation “unintelligibility” condition obfuscation meaning...
Article Free Access Share on Concurrent zero-knowledge Authors: Cynthia Dwork IBM Research Division, Almaden Center, 650 Harry Road, San Jose, CA CAView Profile , Moni Naor Dept. of Applied Mathematics and Computer Science, Weizmann Institute Rehovot 76100, Israel IsraelView Amit Sahai MIT Laboratory for 545 Technology Square, Cambridge, MA MAView Authors Info & Claims STOC '98: Proceedings the thirtieth annual ACM symposium Theory computingMay 1998Pages...
We present a general construction of zero-knowledge proof for an NP relation R(x,w) which only makes black-box use secure protocol related multi-partyfunctionality f. The latter is required to be against small number "honest but curious" players. As application, we can translate previous results on the efficiency multiparty computation domain zero-knowledge, improving over constructions efficient proofs. In particular, if verifying R witness length m done by circuit C size s, and assuming...