Corpus ID: 52896846

# A Candidate Group with Infeasible Inversion

@article{Altug2018ACG,
title={A Candidate Group with Infeasible Inversion},
author={Salim Ali Altug and Yilei Chen},
journal={IACR Cryptol. ePrint Arch.},
year={2018},
volume={2018},
pages={926}
}
• Published 28 September 2018
• Computer Science, Mathematics
• IACR Cryptol. ePrint Arch.
Motivated by the potential cryptographic application of building a directed transitive signature scheme, the search for a group with infeasible inversion was initiated in the theses of Hohenberger and Molnar in 2003. Later it was also shown to provide a broadcast encryption scheme by Irrer et al. (2004). However, to date the only case of a group with infeasible inversion is implied by the much stronger primitive of self-bilinear map constructed by Yamakawa et al. (2014) based on the hardness of… Expand
2 Citations
Generic Hardness of Inversion on Ring and Its Relation to Self-Bilinear Map
• Computer Science, Mathematics
• IACR Cryptol. ePrint Arch.
• 2018
A construction of a self-bilinear map based on a ring on which the inversion problem is hard is given, and it is proved that natural complexity assumptions including the multilinear computational Diffie-Hellman (MCDH) assumption hold w.r.t. the resulting sef-bilInear map. Expand
Forward-Secure Edge Authentication for Graphs
• F. Zhu, Xinyi Huang
• Computer Science
• 2021
This work proposes a forward-secure edge authentication scheme for GDGs that can directly give a proof such that ‘there is no edge between nodes $u$ and $v$’, which makes the function of edge authentication schemes more diverse. Expand

#### References

SHOWING 1-10 OF 77 REFERENCES
The cryptographic impact of groups with infeasible inversion
The necessary mathematical criteria for a secure transitive signature scheme when the signatures can be composed in any order are formalized, showing that the edge signatures in such a scheme form a special (and powerful) mathematical group not known to exist: an Abelian trapdoor group with infeasible inversion (ATGII). Expand
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Mathematics, Computer Science
• PQCrypto
• 2011
The main technical idea in this scheme is that the images of torsion bases under the isogeny are transmitted in order to allow the two parties to arrive at a common shared key despite the noncommutativity of the endomorphism ring. Expand
Directed Transitive Signature Scheme
• X. Yi
• Computer Science, Mathematics
• CT-RSA
• 2007
It is proved that $\mathcal{RSADTS}$, associated to a standard digital signature scheme, is transitively unforgeable under adaptive chosen-message attack if the RSA inversion problem over a cyclic group is hard and the standard digital signatures is secure. Expand
Trapdoors for hard lattices and new cryptographic constructions
• Computer Science, Mathematics
• IACR Cryptol. ePrint Arch.
• 2007
A new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption are included. Expand
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
• Mathematics, Computer Science
• EUROCRYPT
• 1998
It is shown that inverting the proposed cryptosystem is computationally equivalent to factoring the non-fundamental discriminant δq, which is intractable for a suitable choice of δ and q, and how one may embed key escrow capability into classical imaginary quadratic field Cryptosystems. Expand
Cryptanalysis of the New CLT Multilinear Map over the Integers
• Computer Science, Mathematics
• EUROCRYPT
• 2016
Two polynomial attacks on the CLT15 multilinear map are presented, which share ideas similar to the cryptanalysis of CLT13 and allow recovery of all secret parameters in timePolynomial in the security parameter, and lead to a full break of theCLT15 multi-million-dollar map for virtually all applications. Expand
Generic Hardness of Inversion on Ring and Its Relation to Self-Bilinear Map
• Computer Science, Mathematics
• IACR Cryptol. ePrint Arch.
• 2018
A construction of a self-bilinear map based on a ring on which the inversion problem is hard is given, and it is proved that natural complexity assumptions including the multilinear computational Diffie-Hellman (MCDH) assumption hold w.r.t. the resulting sef-bilInear map. Expand
A New Elliptic Curve Based Analogue of RSA
• N. Demytko
• Mathematics, Computer Science
• EUROCRYPT
• 1993
A new public key cryptosystem based on elliptic curves over the ring Zn is described. The scheme can be used for both digital signature and encryption applications, does not expand the amount of dataExpand
Public-Key Cryptosystem Based on Isogenies
• Computer Science
• IACR Cryptol. ePrint Arch.
• 2006
The paper describes theoretical background and a publickey encryption technique, followed by security analysis and consideration of cryptosystem parameters selection, and proposes ElGamal public-key encryption and Diffie-Hellman key agreement for an isogeny Cryptosystem. Expand
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
We introduce a new class of public-key functions involving a number n = pq having two large prime factors. As usual, the key n is public, while p and q are the private key used by the issuer forExpand