Memory lower bounds of reductions revisited
From MaRDI portal
Publication:1648781
DOI10.1007/978-3-319-78381-9_3zbMath1423.94113OpenAlexW2794499054MaRDI QIDQ1648781
Goichiro Hanaoka, Keisuke Tanaka, Takahiro Matsuda, Yu Yu Wang
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_3
Related Items (9)
Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ On the security loss of unique signatures ⋮ Parameter-hiding order revealing encryption ⋮ Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ The memory-tightness of authenticated encryption ⋮ On the memory-tightness of hashed ElGamal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distributional complexity of disjointness
- Memory-tight reductions
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Optimal Security Proofs for Full Domain Hash, Revisited
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Waters Signatures with Optimal Security Reduction
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Barriers in cryptography with weak, correlated and leaky sources
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Short and Stateless Signatures from the RSA Assumption
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- Predicate Encryption for Circuits from LWE
- SWIFFT: A Modest Proposal for FFT Hashing
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Practical Identity-Based Encryption Without Random Oracles
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- On the (Im)Possibility of Key Dependent Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- The Probabilistic Communication Complexity of Set Intersection
- A method for obtaining digital signatures and public-key cryptosystems
- Applied Cryptography and Network Security
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Group Signatures with Message-Dependent Opening
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- A Toolkit for Ring-LWE Cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- Tightly-Secure Authenticated Key Exchange
- Efficient Identity-Based Encryption Without Random Oracles
- Fully Anonymous Group Signatures Without Random Oracles
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On the Impossibility of Tight Cryptographic Reductions
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Memory lower bounds of reductions revisited
