Pages that link to "Item:Q5445497"

The following pages link to Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497):

Displaying 31 items.

• Policy-based signature scheme from lattices (Q306050) (← links)
• Programmable hash functions and their applications (Q434345) (← links)
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
• An efficient homomorphic aggregate signature scheme based on lattice (Q1718616) (← links)
• Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
• Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
• A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
• Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
• On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
• Post-quantum cryptography: lattice signatures (Q2390954) (← links)
• Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
• Lattice-based completely non-malleable public-key encryption in the standard model (Q2448075) (← links)
• An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption (Q2629405) (← links)
• Post-Quantum Forward-Secure Onion Routing (Q2794504) (← links)
• An Efficient Post-Quantum One-Time Signature Scheme (Q2807220) (← links)
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
• Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
• Identity-Based Blind Signature from Lattices in Standard Model (Q2980856) (← links)
• One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
• On ideal lattices, Gröbner bases and generalized hash functions (Q4563584) (← links)
• Identity-based blind signature from lattices (Q4641449) (← links)
• Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
• Lattice-based linearly homomorphic signature scheme over binary field (Q5018301) (← links)
• Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
• Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
• Lattice-based programmable hash functions and applications (Q6182001) (← links)