Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions

No abstract is available for this paper.

• Publication year

  2024

• Venue

  Annual International Cryptology Conference

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-031-68379-4_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fine-Grained Non-Interactive Key Exchange, Revisited

  2024cited by this paper
• Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds

  2023influential reference
• Fine-Grained Secure Attribute-Based Encryption

  2023influential reference
• Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security

  2022influential reference
• Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited

  2021cited by this paper
• New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust

  2020cited by this paper
• Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange

  2020cited by this paper
• Public-Key Cryptography in the Fine-Grained Setting

  2019influential reference
• Fine-Grained Cryptography Revisited

  2019influential reference
• Fine-Grained Secure Computation

  2018cited by this paper
• The Algebraic Group Model and its Applications

  2018cited by this paper
• On Tightly Secure Non-Interactive Key Exchange

  2018cited by this paper
• Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)

  2017cited by this paper
• Tight Hardness for Shortest Cycles and Paths in Sparse Graphs

  2017cited by this paper
• Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms

  2016cited by this paper
• Fine-Grained Cryptography

  2016influential reference
• Consequences of Faster Alignment of Sequences

  2014influential reference
• Fully secure constrained pseudorandom functions using random oracles

  2014influential reference
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

  2014cited by this paper
• Non-Interactive Key Exchange

  2013cited by this paper
• Constrained Pseudorandom Functions and Their Applications

  2013influential reference
• Basing Weak Public-Key Cryptography on Strong One-Way Functions

  2008cited by this paper
• Abstract Models of Computation in Cryptography

  2005cited by this paper
• On Generating the Initial Key in the Bounded-Storage Model

  2004influential reference
• A One Round Protocol for Tripartite Diffie–Hellman

  2000cited by this paper
• Unconditional Security Against Memory-Bounded Adversaries

  1997influential reference
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• A Storage Complexity Based Analogue of Maurer Key Establishment Using Public Channels

  1995cited by this paper
• Secret key agreement by public discussion from common information

  1993influential reference
• Simulating BPP using a general weak random source

  1991influential reference
• A hard-core predicate for all one-way functions

  1989cited by this paper
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

  1987cited by this paper
• Algebraic methods in the theory of lower bounds for Boolean circuit complexity

  1987cited by this paper
• One-Way Permutations in NC0

  1987cited by this paper
• Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

  1986cited by this paper
• Secure communications over insecure channels

  1978cited by this paper
• New Directions in Cryptography

  1976cited by this paper

• No citing papers are available for this paper.