Fine-grained non-interactive key-exchange: constructions and lower bounds

DOI10.1007/978-3-031-30545-0_3MaRDI QIDQ6138079zbMATH OpenFDO

Authors A. Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi

Publication date 16 January 2024

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

random oracles\(K\)-NIKE protocolsMerkle's two-party protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fine-grained non-interactive key exchange, revisited
• Fine-grained non-interactive key-exchange without idealized assumptions
• Non-interactive key exchange
• Universally Composable Non-Interactive Key Exchange
• Towards tight adaptive security of non-interactive key exchange

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• A monte carlo method for factorization
• Average-case fine-grained hardness
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• Cryptography and Coding
• Distributed Merkle's puzzles
• Fine-Grained Cryptography
• Fine-grained cryptography revisited
• Fine-grained secure computation
• Limits on the efficiency of (ring) LWE-based non-interactive key exchange
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
• Merkle puzzles in a quantum world
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• New directions in cryptography
• Non-interactive key exchange
• Non-interactive zero-knowledge proofs with fine-grained security
• Non-trivial witness encryption and null-iO from standard assumptions
• On building fine-grained one-way functions from strong average-case hardness
• On the impossibility of purely algebraic signatures
• Proofs of Work from worst-case assumptions
• Public-key cryptography in the fine-grained setting
• Secure communications over insecure channels
• The algebraic group model and its applications
• To label, or not to label (in generic groups)

Cited in

(3)

• Communication lower bounds of key-agreement protocols via density increment arguments
• Fine-grained non-interactive key-exchange without idealized assumptions
• Fine-grained non-interactive key exchange, revisited

This page was built for publication: Fine-grained non-interactive key-exchange: constructions and lower bounds

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