Results 1 to 10 of about 35,823 (237)
Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves [PDF]
Journal of Mathematical Cryptology, 2020 We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n ≥ 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is believed to be ...
Boneh Dan +7 more
doaj +5 more sources
Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange [PDF]
IEEE Access, 2020 Multi-Party Non-Interactive Key Exchange (MP-NIKE) is a fundamental cryptographic primitive in which users register into a key generation centre and receive a public/private key pair each.
Majid Salimi +3 more
doaj +6 more sources
HybridPKE: A forward-secure non-interactive quantum-safe hybrid key exchange scheme
Engineering Science and Technology, an International Journal, 2022 The schemes submitted to NIST call for standardization of post-quantum cryptography have some common drawbacks in terms of decryption failure probability, scalability, and switching issues from pre-quantum to post- quantum cryptography. In this paper, we
Simran Choudhary, Anil Gupta
doaj +4 more sources
Non-Interactive Key Exchange [PDF]
Lecture Notes in Computer Science, 2013 Non-interactive key exchange (NIKE) is a fundamental but much-overlooked cryptographic primitive. It appears as a major contribution in the ground-breaking paper of Diffie and Hellman, but NIKE has remained largely unstudied since then. In this paper, we provide different security models for this primitive and explore the relationships between them. We
Eike Kiltz +2 more
exaly +4 more sources
Towards Tight Adaptive Security of Non-interactive Key Exchange
Lecture Notes in Computer Science, 2021 We investigate the quality of security reductions for non-interactive key exchange (NIKE) schemes. Unlike for many other cryptographic building blocks (like public-key encryption, signatures, or zero-knowledge proofs), all known NIKE security reductions to date are non-tight, i.e., lose a factor of at least the number of users in the system.
Roman Langrehr +2 more
exaly +4 more sources
Non-interactive zero-knowledge proof scheme from RLWE-based key exchange.
PLoS ONE, 2021 Lattice-based non-interactive zero-knowledge proof has been widely used in one-way communication and can be effectively applied to resist quantum attacks.
Shaofen Xie +3 more
doaj +4 more sources
On Tightly Secure Non-Interactive Key Exchange
Lecture Notes in Computer Science, 2018 We consider the reduction loss of security reductions for non-interactive key exchange (NIKE) schemes. Currently, no tightly secure NIKE schemes exist, and in fact Bader et al. (EUROCRYPT 2016) provide a lower bound (of \(\varOmega (n^2)\), where \(n\) is the number of parties an adversary interacts with) on the reduction loss for a large class of NIKE
Dennis Hofheinz, Hofheinz Dennis
exaly +4 more sources
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange
Lecture Notes in Computer Science, 2020 Making non-interactive an interactive protocol, i.e. achieving the security goal in a single-round communication, is a common practice in the realm of public key cryptography. A practice that, at the time of writing, does not seem apply to key-exchange protocols based on the learning with errors problem (LWE), where all protocols are interactive.
Alon Rosen, Guo Siyao, Rosen Alon
exaly +4 more sources
天地一体化信息网络, 2021 For scenarios such as space-integrated-ground information network where satellite resources are limited and communication delays are large, in response to the requirements of non-interactive key exchange in the satellite communication network, a non ...
Mengru LIU, Yulong FU, Jin CAO, Hui LI
doaj +3 more sources
Fine-Grained Non-interactive Key Exchange, Revisited
Lecture Notes in Computer ScienceWe revisit the construction of multiparty non-interactive key-exchange protocols with fine-grained security, which was recently studied in (Afshar et al., Eurocrypt 2023). Their work introduced a 4party non-interactive key exchange with quadratic hardness, and proved it secure in Shoup's generic group model. This positive result was complemented with a
Couteau Geoffroy
exaly +4 more sources