Adaptive oblivious transfer with access control from lattice assumptions
From MaRDI portal
Publication:5919120
DOI10.1016/j.tcs.2021.09.001OpenAlexW3198763090WikidataQ114657692 ScholiaQ114657692MaRDI QIDQ5919120
San Ling, Benoît Libert, Khoa Nguyen, Huaxiong Wang, Fabrice Mouhartem
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01622197v3/file/OT-LWE-full-version.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restricted adaptive oblivious transfer
- Computationally secure oblivious transfer
- Confined guessing: new signatures from standard assumptions
- Riding on Asymmetry: Efficient ABE for Branching Programs
- Sanitization of FHE Ciphertexts
- FHE Circuit Privacy Almost for Free
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Generic Fully Simulatable Adaptive Oblivious Transfer
- Oblivious Transfer with Access Control : Realizing Disjunction without Duplication
- Oblivious Transfer with Hidden Access Control Policies
- A new paradigm for public key identification
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
- Evaluating Branching Programs on Encrypted Data
- A Framework for Efficient and Composable Oblivious Transfer
- Universally Composable Adaptive Oblivious Transfer
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Conditional Oblivious Transfer and Timed-Release Encryption
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Advances in Cryptology - EUROCRYPT 2004
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Fuzzy Identity-Based Encryption
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Generating Shorter Bases for Hard Random Lattices
- Advances in Cryptology - CRYPTO 2003
- Simulatable Adaptive Oblivious Transfer
- Efficient Fully-Simulatable Oblivious Transfer
- Classical hardness of learning with errors
- Theory of Cryptography
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Adaptive oblivious transfer with access control from lattice assumptions
