Fine-grained non-interactive key-exchange: constructions and lower bounds
From MaRDI portal
Publication:6138079
DOI10.1007/978-3-031-30545-0_3zbMATH Open1530.94015MaRDI QIDQ6138079FDOQ6138079
Elahe Sadeghi, Mohammad Mahmoody, Geoffroy Couteau, A. Afshar
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Cites Work
- New directions in cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- A monte carlo method for factorization
- Secure communications over insecure channels
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Cryptography and Coding
- Non-interactive zero-knowledge proofs with fine-grained security
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- To label, or not to label (in generic groups)
- The algebraic group model and its applications
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Merkle Puzzles in a Quantum World
- Fine-grained secure computation
- Fine-Grained Cryptography
- Average-case fine-grained hardness
- Fine-grained cryptography revisited
- Non-Interactive Key Exchange
- Proofs of Work from worst-case assumptions
- Non-trivial witness encryption and null-iO from standard assumptions
- Public-key cryptography in the fine-grained setting
- On building fine-grained one-way functions from strong average-case hardness
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Distributed Merkle's puzzles
- On the impossibility of purely algebraic signatures
Cited In (3)
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)
