Fine-grained non-interactive key-exchange without idealized assumptions
From MaRDI portal
Publication:6648207
DOI10.1007/978-3-031-68379-4_8MaRDI QIDQ6648207
Jia-xin Pan, Chuanjie Su, Yuyu Wang
Publication date: 4 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- One-way permutations in NC 0
- Fine-grained secure computation
- A one round protocol for tripartite Diffie-Hellman
- The algebraic group model and its applications
- On tightly secure non-interactive key exchange
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Non-interactive zero-knowledge proofs with fine-grained security
- Public-key cryptography in the fine-grained setting
- Secure communications over insecure channels
- Fine-Grained Cryptography
- Constrained Pseudorandom Functions and Their Applications
- New directions in cryptography
- A storage complexity based analogue of Maurer key establishment using public channels
- Non-Interactive Key Exchange
- Consequences of Faster Alignment of Sequences
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Cryptography and Coding
- Fine-grained cryptography revisited
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- Speak much, remember little: cryptography in the bounded storage model, revisited
This page was built for publication: Fine-grained non-interactive key-exchange without idealized assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648207)
