Generic hardness of inversion on ring and its relation to self-bilinear map
From MaRDI portal
Publication:1989358
DOI10.1016/j.tcs.2020.03.009zbMath1455.94198OpenAlexW3013974910MaRDI QIDQ1989358
Takashi Yamakawa, Noboru Kunihiro, Shota Yamada, Goichiro Hanaoka
Publication date: 21 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.03.009
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Breaking RSA may be as difficult as factoring
- On the ultimate complexity of factorials
- Factoring integers with elliptic curves
- A key distribution system equivalent to factoring
- Factoring numbers in O(log n) arithmetic steps
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Graded encoding schemes from obfuscation
- A self-pairing map and its applications to cryptography
- Complexity of a determinate algorithm for the discrete logarithm
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
- The distinction between fixed and random generators in group-based assumptions
- Multilinear Maps from Obfuscation
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Leveled Fully Homomorphic Signatures from Standard Lattices
- The Group of Signed Quadratic Residues and Applications
- On Black-Box Ring Extraction and Integer Factorization
- A NOTE ON SELF-BILINEAR MAPS
- On the Analysis of Cryptographic Assumptions in the Generic Ring Model
- A method for obtaining digital signatures and public-key cryptosystems
- New Constructions and Applications of Trapdoor DDH Groups
- Candidate Multilinear Maps from Ideal Lattices
- The straight line complexity of small factorials and primorials
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Breaking RSA Generically Is Equivalent to Factoring
This page was built for publication: Generic hardness of inversion on ring and its relation to self-bilinear map
