Post-Quantum Constant-Round Group Key Exchange from Static Assumptions

DOI10.1007/978-981-15-5191-8_18MaRDI QIDQ4964367zbMATHOpenAlexFDO

Authors Katsuyuki Takashima

Publication date 25 February 2021

Published in International Symposium on Mathematics, Quantum Theory, and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-15-5191-8_18

zbMATH Keywords

lattice-based cryptographypost-quantum cryptographyisogeny-based cryptographystatic assumptionsconstant-round group key exchange

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Post-quantum zero knowledge in constant rounds
• Constant-round group key exchange from the ring-LWE assumption
• Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
• Post-quantum static-static key agreement using multiple protocol instances
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting
• Group action key encapsulation and non-interactive key exchange in the QROM
• The hidden subgroup problem and post-quantum group-based cryptography
• Group key establishment in a quantum-future scenario
• Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies

Cites work

• scientific article; zbMATH DE number 1088922 (Why is no real title available?)
• scientific article; zbMATH DE number 1759313 (Why is no real title available?)
• scientific article; zbMATH DE number 3356934 (Why is no real title available?)
• CSI-FiSh: efficient isogeny based signatures through class group computations
• CSIDH: an efficient post-quantum commutative group action
• Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
• Constant-round group key exchange from the ring-LWE assumption
• Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
• Fully secure functional encryption with general relations from the decisional linear assumption
• Identifying supersingular elliptic curves
• Multiparty non-interactive key exchange and more from isogenies on elliptic curves
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Protocols for authentification and key establishment
• Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
• Scalable protocols for authenticated group key exchange
• Supersingular isogeny Diffie-Hellman authenticated key exchange
• Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(5)

• One-round authenticated group key exchange from isogenies
• An Efficient Construction of Quantum Attack Resistant Proxy Re-Encryption Based on (Semi)group Factorization Problems*
• Constant-round group key exchange from the ring-LWE assumption
• Tree-Based Ring-LWE Group Key Exchanges with Logarithmic Complexity
• Group key exchange protocols from supersingular isogenies

Describes a project that uses

Uses Software

• KEM-DEM

This page was built for publication: Post-Quantum Constant-Round Group Key Exchange from Static Assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964367)