A5054130528- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Privacy-Preserving Technologies in Data
- Cryptographic Implementations and Security
- Chaos-based Image/Signal Encryption
- Internet Traffic Analysis and Secure E-voting
- Security and Verification in Computing
- Advanced Steganography and Watermarking Techniques
- Advanced Data Storage Technologies
- Occupational Health and Performance
- Distributed systems and fault tolerance
- Advanced Authentication Protocols Security
- Optimization and Search Problems
- Algorithms and Data Compression
- Blockchain Technology Applications and Security
- Sports injuries and prevention
- Benford’s Law and Fraud Detection
- Adversarial Robustness in Machine Learning
- Chinese history and philosophy
- Coding theory and cryptography
- Occupational Health and Safety Research
- Bluetooth and Wireless Communication Technologies
- User Authentication and Security Systems
- Cryptography and Residue Arithmetic
- Mobile Crowdsensing and Crowdsourcing
McMaster University
2021
University of California, Los Angeles
2006-2015
University of California, Berkeley
2015
UCLA Health
2006-2014
With the gaining popularity of remote storage (e.g. in Cloud), we consider setting where a small, protected local machine wishes to access data on large, untrusted machine. This was introduced RAM model context software protection by Goldreich and Ostrovsky. A secure Oblivious simulation allows for client, with small (e.g., constant size) memory, hide not only but also sequence locations it accesses (both reads writes) unprotected memory size n.Our main results are as follows:• We analyze...
Previous chapter Next Full AccessProceedings Proceedings of the 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)On (In)security Hash-based Oblivious RAM and a New Balancing SchemeEyal Kushilevitz, Steve Lu, Rafail OstrovskyEyal Ostrovskypp.143 - 156Chapter DOI:https://doi.org/10.1137/1.9781611973099.13PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract With gaining popularity remote storage (e.g. in Cloud), we consider setting where...
A well-known concern in the setting of identity based encryption is that PKG all powerful and has to be completely trusted. To mitigate this problem, notion Accountable Authority Identity-Based Encryption (A-IBE) was recently introduced by Goyal. Goyal provided constructions realize A-IBE only white box weak black models. However, security guarantees these models fall short those required practice.
Yao's garbled circuit construction is a very fundamental result in cryptography and recent efficiency optimizations have brought it much closer to practice. However these constructions work only for circuits garbling RAM program involves the inefficient process of first converting into circuit. Towards goal avoiding this inefficiency, Lu Ostrovsky (Eurocrypt 2013) introduced notion "garbled RAM" as method garble programs directly. It can be seen analogue such that, size time takes create...
Garbled RAM, introduced by Lu and Ostrovsky, enables the task of garbling a RAM (Random Access Machine) program directly, there avoiding inefficient process first converting it into circuit. can be seen as analogue Yao's garbled circuit construction, except that known realizations make non-black-box use underlying cryptographic primitives. In this paper we remove limitation provide black-box construction with polylogarithmic overhead. Our scheme allows for multiple programs being executed on...
Recent advances in fast protocols for vector oblivious linear evaluation (VOLE) have inspired a family of new VOLE-based lightweight designated-verifier NIZK (Weng et al., S&P 2021, Baum Crypto Dittmer ITC Yang CCS 2021). In particular, the Line-Point Zero Knowledge (LPZK) protocol al. has advantage being entirely non-cryptographic given single instance random VOLE correlation.
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: are given an arbitrary graph (V,E) where every node and edge assigned image. Images the vertices “public” edges “secret”. The problem considering is how to make construction such when encoded two adjacent printed transparencies overlapped, image corresponding revealed. We define most stringent security guarantees (perfect secrecy) show general all graphs cost (in terms...
We show a constant-overhead interactive zero-knowledge (ZK) proof system for RAM programs, that is, ZK in which the communication complexity as well running times of prover and verifier scale linearly size memory N time T underlying program. Besides yielding an asymptotic improvement prior work, our implementation gives concrete performance improvements RAM-based proofs. In particular, supports proofs private read/write accesses to 64~MB (224 32-bit words) using only 34~bytes per access,...
In this work we describe a token-based solution to Contact Tracing via Distributed Point Functions (DPF) and, more generally, Function Secret Sharing (FSS). The key idea behind the is that FSS natively supports secure keyword search on raw sets of keywords without need for processing data structure set membership. Furthermore, functionality enables adding up numerical payloads associated with multiple matches additional interaction. These features make an attractive tool lightweight...
Private set intersection (PSI) is one of the most extensively studied instances secure computation. PSI allows two parties to compute their input sets without revealing anything else. Other useful variants include PSI-Payload, where output includes payloads associated with members intersection, and PSI-Sum, sum instead individual ones.