Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: NTRU prime: reducing attack surface at low cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Shot Verifiable Encryption from Lattices / 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: Worst-case to average-case reductions for module lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Signatures without Trapdoors / 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: Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kurosawa-Desmedt meets tight security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Nested Dual System Groups, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Implementation of Bilinear Pairings on ARM Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-interactive Shuffle with Pairing Based Verifiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightly Secure Signatures and Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Structure Preserving Signatures Under Standard Bilinear Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure-Preserving Signatures from Standard Assumptions, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Adaptive NIZK for Linear Subspaces Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactly Hiding Linear Spans / 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: The Kernel Matrix Diffie-Hellman Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic two-round argument systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Optimal Interactive Proofs for Circuit Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 02:51, 16 July 2024

scientific article
Language Label Description Also known as
English
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
scientific article

    Statements

    Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (English)
    0 references
    0 references
    0 references
    9 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references