Strongly secure authenticated key exchange from factoring, codes, and lattices
type: Item
instance of: scholarly article
title: Strongly secure authenticated key exchange from factoring, codes, and lattices
zbMATH Open document ID: 1344.94083
author: Atsushi Fujioka
author: Koutarou Suzuki
author: Keita Xagawa
author: Kazuki Yoneyama
published in: Designs, Codes and Cryptography
publication date: 2015-09-01T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6477348
zbMATH Keywords: authenticated key exchange
zbMATH Keywords: \(\mathrm {CK}^+\) model
zbMATH Keywords: key encapsulation mechanism
zbMATH Keywords: identity-based authenticated key exchange
describes a project that uses: HMQV
describes a project that uses: McEliece
describes a project that uses: NAXOS
MaRDI profile type: Publication
full work available at URL: s10623-014-9972-2
OpenAlex ID: W2051510359
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: Q4228459
cites work: Pseudorandom Functions and Lattices
cites work: Q4341751
cites work: Wild McEliece
cites work: Smaller Decoding Exponents: Ball-Collision Decoding
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Chosen‐Ciphertext Security from Identity‐Based Encryption
cites work: Q4783728
cites work: Efficient One-Round Key Exchange in the Standard Model
cites work: One-round key exchange in the standard model
cites work: On Forward Secrecy in One-Round Key Exchange
cites work: Q4542539
cites work: Q2778861
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Chosen-Ciphertext Secure RSA-Type Cryptosystems
cites work: Q4249317
cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
cites work: Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
cites work: Computational Extractors and Pseudorandomness
cites work: Q4035738
cites work: A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
cites work: Making the Diffie-Hellman Protocol Identity-Based
cites work: Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys
cites work: Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
cites work: Generic One Round Group Key Exchange in the Standard Model
cites work: Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
cites work: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
cites work: Practical Chosen Ciphertext Secure Encryption from Factoring
cites work: The Group of Signed Quadratic Residues and Applications
cites work: Applied Cryptography and Network Security
cites work: Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
cites work: Adaptive Trapdoor Functions and Chosen-Ciphertext Security
cites work: HMQV: A High-Performance Secure Diffie-Hellman Protocol
cites work: Cryptographic Extraction and Key Derivation: The HKDF Scheme
cites work: Stronger Security of Authenticated Key Exchange
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Semantic security for the McEliece cryptosystem without random oracles
cites work: Authenticated Key Exchange and Key Encapsulation in the Standard Model
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Theory of Cryptography
cites work: Lossy trapdoor functions and their applications
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: A New Security Model for Authenticated Key Agreement
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: One-Round Authenticated Key Exchange with Strong Forward Secrecy in the Standard Model against Constrained Adversary
DOI: 10.1007/S10623-014-9972-2
description: scientific article; zbMATH DE number 6477348