Anonymous IBE, leakage resilience and circular security from new assumptions
From MaRDI portal
Publication:1648813
DOI10.1007/978-3-319-78381-9_20zbMATH Open1423.94056OpenAlexW2750848363MaRDI QIDQ1648813FDOQ1648813
Authors: Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan 
Publication date: 9 July 2018
Full work available at URL: https://hdl.handle.net/1721.1/137868
Recommendations
- Anonymous and leakage resilient IBE and IPE
- Anonymous Identity-Based Hash Proof System and Its Applications
- Circular and KDM security for identity-based encryption
- Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts
- Practical Identity-Based Encryption Without Random Oracles
Cites Work
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- A key distribution system equivalent to factoring
- Identity-based cryptosystems and signature schemes
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient lattice (H)IBE in the standard model
- Practical Identity-Based Encryption Without Random Oracles
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Public-key cryptosystems resilient to key leakage
- A proof of security of Yao's protocol for two-party computation
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Public-key encryption schemes with auxiliary inputs
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Leakage-resilient cryptography from minimal assumptions
- Title not available (Why is that?)
- How to use indistinguishability obfuscation
- More on average case vs approximation complexity
- Identity-based encryption from the Diffie-Hellman assumption
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Bonsai trees, or how to delegate a lattice basis
- Bounded key-dependent message security
- Laconic oblivious transfer and its applications
- Key-dependent message security: generic amplification and completeness
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- How to obfuscate programs directly
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- New constructions of identity-based and key-dependent message secure encryption schemes
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Compactness vs collusion resistance in functional encryption
- From Minicrypt to Obfustopia via private-key functional encryption
- Simple and generic constructions of succinct functional encryption
- From selective IBE to full IBE and selective HIBE
- Key dependent message security and receiver selective opening security for identity-based encryption
- Collision resistant hashing from sub-exponential learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Semi-adaptive security and bundling functionalities made generic and easy
Cited In (49)
- Efficient identity-based encryption with hierarchical key-insulation from HIBE
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- Efficient laconic cryptography from learning with errors
- Lower bounds on assumptions behind registration-based encryption
- Minicrypt primitives with algebraic structure and applications
- Registration-based encryption: removing private-key generator from IBE
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Counterexamples to new circular security assumptions underlying iO
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Collusion resistant traitor tracing from learning with errors
- Non-interactive batch arguments for NP from standard assumptions
- On the Anonymization of Cocks IBE Scheme
- Sublinear secure computation from new assumptions
- How to build a trapdoor function from an encryption scheme
- Optimizing registration based encryption
- Anonymous and leakage resilient IBE and IPE
- Collusion-resistant functional encryption for RAMs
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- Statistically sender-private OT from LPN and derandomization
- Forward-secure encryption with fast forwarding
- CCA security and trapdoor functions via key-dependent-message security
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Laconic branching programs from the Diffie-Hellman assumption
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- R3PO: reach-restricted reactive program obfuscation and its applications
- Towards compact identity-based encryption on ideal lattices
- Updatable public key encryption in the standard model
- Two-round oblivious transfer from CDH or LPN
- Master-key KDM-secure IBE from pairings
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
- Universal proxy re-encryption
- Anonymous IBE from Quadratic Residuosity with Fast Encryption
- Verifiable registration-based encryption
- CPA-to-CCA transformation for KDM security
- Amortizing rate-1 OT and applications to PIR and PSI
- Laconic private set intersection and applications
- Lossy cryptography from code-based assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
- Optimal bounded-collusion secure functional encryption
- Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices
- BKW meets Fourier new algorithms for LPN with sparse parities
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Chosen ciphertext security from injective trapdoor functions
- Incompressible encodings
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Adaptively secure garbling schemes for parallel computations
This page was built for publication: Anonymous IBE, leakage resilience and circular security from new assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648813)
