Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information
From MaRDI portal
Publication:2817818
DOI10.1007/978-3-319-40367-0_17zbMath1346.94135OpenAlexW2502447166MaRDI QIDQ2817818
Goichiro Hanaoka, Takashi Yamakawa, Noboru Kunihiro
Publication date: 2 September 2016
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40367-0_17
Related Items
Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs, Generic hardness of inversion on ring and its relation to self-bilinear map
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multilinear Maps from Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Low Overhead Broadcast Encryption from Multilinear Maps
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Cryptanalysis of the Multilinear Map over the Integers
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Homomorphic Signatures for Polynomial Functions
- The Group of Signed Quadratic Residues and Applications
- New Multilinear Maps Over the Integers
- Perfect Non-interactive Zero Knowledge for NP
- A NOTE ON SELF-BILINEAR MAPS
- Candidate Multilinear Maps from Ideal Lattices
- Graph-Induced Multilinear Maps from Lattices
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Efficient Non-interactive Proof Systems for Bilinear Groups
