Generic hardness of inversion on ring and its relation to self-bilinear map
type: Item
instance of: scholarly article
title: Generic hardness of inversion on ring and its relation to self-bilinear map
zbMATH Open document ID: 1455.94198
author: Takashi Yamakawa
author: Shota Yamada
author: Goichiro Hanaoka
author: Noboru Kunihiro
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 7191331
zbMATH Keywords: cryptography
zbMATH Keywords: generic ring
zbMATH Keywords: straight-line program
zbMATH Keywords: self-bilinear map
zbMATH Keywords: multilinear map
MaRDI profile type: Publication
full work available at URL: j.tcs.2020.03.009
OpenAlex ID: W3013974910
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q4737249
cites work: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
cites work: Breaking RSA Generically Is Equivalent to Factoring
cites work: On the Analysis of Cryptographic Assumptions in the Generic Ring Model
cites work: A NOTE ON SELF-BILINEAR MAPS
cites work: Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
cites work: Q4432349
cites work: Homomorphic Signatures with Efficient Verification for Polynomial Functions
cites work: Q4783716
cites work: On Black-Box Ring Extraction and Integer Factorization
cites work: Breaking RSA may be as difficult as factoring
cites work: Multilinear Maps from Obfuscation
cites work: Graded encoding schemes from obfuscation
cites work: A self-pairing map and its applications to cryptography
cites work: The distinction between fixed and random generators in group-based assumptions
cites work: On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?''
cites work: On the ultimate complexity of factorials
cites work: The straight line complexity of small factorials and primorials
cites work: Factoring numbers in O(log n) arithmetic steps
cites work: A key distribution system equivalent to factoring
cites work: The Group of Signed Quadratic Residues and Applications
cites work: New Constructions and Applications of Trapdoor DDH Groups
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Q4847917
cites work: Factoring integers with elliptic curves
cites work: Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information
cites work: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
cites work: Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
DOI: 10.1016/J.TCS.2020.03.009
description: scientific article; zbMATH DE number 7191331