Memory lower bounds of reductions revisited (Q1648781): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu Yu Wang / rank
Normal rank
 
Property / author
 
Property / author: Yu Yu Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794499054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-tight reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightly-Secure Authenticated Key Exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Tight Cryptographic Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Key Dependent Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waters Signatures with Optimal Security Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and Stateless Signatures from the RSA Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Security Proofs for Full Domain Hash, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers in cryptography with weak, correlated and leaky sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicate Encryption for Circuits from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Group Signature Scheme from Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Cryptography and Network Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Anonymous Group Signatures Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Group Signatures with Logarithmic Signature Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Group Signature Scheme with Verifier-Local Revocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case to average-case reductions for module lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge arguments for lattice-based PRFs and applications to E-cash / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lattice-Based Group Signature Scheme with Message-Dependent Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Toolkit for Ring-LWE Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Efficient Group Signatures from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness of ring-LWE for any ring and modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures with Message-Dependent Opening / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new paradigm for public key identification / rank
 
Normal rank

Latest revision as of 02:50, 16 July 2024

scientific article
Language Label Description Also known as
English
Memory lower bounds of reductions revisited
scientific article

    Statements

    Memory lower bounds of reductions revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 July 2018
    0 references
    0 references
    memory
    0 references
    tightness
    0 references
    lower bound
    0 references
    uniqueness
    0 references
    black-box reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references