Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Theory of Cryptography Conference

• Publication date

  2006-03-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11681878_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.

• Approximating the Svp to within a Factor ?

  2007cited by this paper
• Generalized Compact Knapsacks Are Collision Resistant

  2006influential reference
• How to Break MD5 and Other Hash Functions

  2005cited by this paper
• Finding Collisions in the Full SHA-1

  2005cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005cited by this paper
• Hardness of approximating the shortest vector problem in lattices

  2004cited by this paper
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

  2003cited by this paper
• New lattice based cryptographic constructions

  2003cited by this paper
• Complexity of lattice problems

  2002cited by this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002influential reference
• Lower bounds on the efficiency of generic cryptographic constructions

  2000cited by this paper
• The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

  1998cited by this paper
• Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?

  1998cited by this paper
• The shortest vector in a lattice is hard to approximate to within some constant

  1998cited by this paper
• An improved worst-case to average-case connection for lattice problems

  1997cited by this paper
• A public-key cryptosystem with worst-case/average-case equivalence

  1997cited by this paper
• Collision-Free Hashing from Lattice Problems

  1996cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Public-Key Cryptosystems from Lattice Reduction Problems

  1996cited by this paper
• The hardness of approximate optima in lattices, codes, and systems of linear equations

  1993cited by this paper
• One-way functions are necessary and sufficient for secure signatures

  1990cited by this paper
• Universal one-way hash functions and their cryptographic applications

  1989cited by this paper
• Abstract Algebra

  1968cited by this paper

• A lattice-based linkable authentication scheme for privacy-preserving vehicular systems

  2026cites this paper
• ABBA: Lattice-based Commitments from Commutators

  2026cites this paper
• MiNTT: A Family of Module Lattice-Based Cryptographic Compression Functions

  2026cites this paper
• Proving multiplicative relations for lattice commitments in batch

  2026cites this paper
• PAORE: public-key authenticated order-revealing encryption

  2026influential citation
• More Efficient Lattice-Based Electronic Voting from NTRU

  2025cites this paper
• LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems

  2025cites this paper
• Secure and efficient fully dynamic group signature based on RSIS and RLWE

  2025cites this paper
• Simple and General Counterexamples for Private-Coin Evasive LWE

  2025cites this paper
• Wagner's Algorithm Provably Runs in Subexponential Time for SIS∞

  2025cites this paper
• Ring-LWR based Commitments and ZK-PoKs with Application to Verifiable Quantum-Safe Searchable Symmetric Encryption

  2025cites this paper
• A survey of folding-based zero-knowledge proofs

  2025cites this paper
• Quantum-safe forward secure password authenticated key life-cycle management scheme with key update mechanism

  2025cites this paper
• Tight Adaptive Simulation Security for Identity-based Inner-Product FE in the (Quantum) Random Oracle Model

  2025cites this paper
• Multivariate exponential equations with unknown coefficients

  2025cites this paper
• Proofs of Retrievability With Public Verifiability From Lattices

  2025cites this paper
• Unidirectional Key Update in Updatable Encryption, Revisited

  2024cites this paper
• Quantum Security of a Compact Multi-Signature

  2024cites this paper
• A Concrete LIP-Based KEM With Simple Lattices

  2024cites this paper
• Quantum-Resistant Forward-Secure Digital Signature Scheme Based on q-ary Lattices

  2024cites this paper
• Toward Efficient Key Extraction of LBC Over Ring: Fast Non-Spherical G-Lattice Sampler and Optimized Perturbation Generation

  2024cites this paper
• Efficient Key Generation on Lattice Cryptography for Privacy Protection in Mobile IoT Crowdsourcing

  2024cites this paper
• Discriminants of Number Fields

  2024cites this paper
• Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets

  2024cites this paper
• Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting

  2024cites this paper
• A survey on lattice-based digital signature

  2024cites this paper
• GCKSign: Simple and efficient signatures from generalized compact knapsack problems

  2024cites this paper
• New Techniques for Preimage Sampling: Improved NIZKs and More from LWE

  2024influential citation
• Advanced authentication of IoT sensor network for industrial safety

  2024cites this paper
• Discrete Gaussians Modulo Sub-Lattices: New Leftover Hash Lemmas for Discrete Gaussians

  2024cites this paper
• A Digital signature scheme based on Module-LWE and Module-SIS

  2024cites this paper
• Evasive LWE Assumptions: Definitions, Classes, and Counterexamples

  2024cites this paper
• Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE

  2023cites this paper
• Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler With Realizations

  2023cites this paper
• Revocable Cryptography from Learning with Errors

  2023cites this paper
• Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals

  2023cites this paper
• Densidade de Centro de uma Família de Reticulados Cíclicos

  2023cites this paper
• Provably secure attribute-based authenticated encryption with keyword search from ideal lattices

  2023cites this paper
• Faster Implementation of Ideal Lattice-Based Cryptography Using AVX512

  2023influential citation
• Inner product encryption from Middle-Product Learning With Errors

  2023cites this paper
• SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions

  2023cites this paper
• Revisiting Preimage Sampling for Lattices

  2023cites this paper
• Full Cycle Data Protection Scheme of Power Parameters in Smart Grid Based on Lattice Encryption

  2023cites this paper
• The Complexity of the Shortest Vector Problem

  2023cites this paper
• RLWE-based public key searchable encryption: securer, faster, and lower end-to-end delay for cloud computing

  2023cites this paper
• A lattice-based public key encryption scheme with delegated equality test

  2023cites this paper
• A fully classical LLL algorithm for modules

  2022cites this paper
• Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing

  2022cites this paper
• Asymptotically Quasi-Optimal Cryptography

  2022cites this paper
• Functional Commitments for All Functions, with Transparent Setup

  2022cites this paper
• Efficient Public Key Searchable Encryption Schemes from Standard Hard Lattice Problems for Cloud Computing

  2022cites this paper
• A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions

  2022cites this paper
• A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions

  2022cites this paper
• Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract)

  2022cites this paper
• Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

  2022cites this paper
• A Survey on Exotic Signatures for Post-uantum Blockchain: Challenges & Research Directions

  2022cites this paper
• Parallel Small Polynomial Multiplication for Dilithium: A Faster Design and Implementation

  2022cites this paper
• Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem

  2022cites this paper
• Improved Lattice-Based Mix-Nets for Electronic Voting

  2022influential citation
• Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

  2022cites this paper
• Practical Sublinear Proofs for R1CS from Lattices

  2022cites this paper
• Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression

  2022cites this paper
• Reductions from module lattices to free module lattices, and application to dequantizing module-LLL

  2022cites this paper
• Round-Optimal Lattice-Based Threshold Signatures, Revisited

  2022influential citation
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems

  2022cites this paper
• GCKSign: Simple and Efficient Signatures from Generalized Compact Knapsacks

  2022influential citation
• Improved Reduction Between SIS Problems Over Structured Lattices

  2021cites this paper
• An efficient fully dynamic group signature with message dependent opening from lattice

  2021cites this paper
• A comprehensive review on collision-resistant hash functions on lattices

  2021cites this paper
• DiLizium: A Two-Party Lattice-Based Signature Scheme

  2021cites this paper
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

  2021cites this paper
• Post-quantum Online Voting Scheme

  2021cites this paper
• Towards Practical and Round-Optimal Lattice-Based Threshold and Blind Signatures

  2021cites this paper
• Efficient Dynamic Group Signature Scheme with Verifier Local Revocation and Time-Bound Keys using Lattices

  2021cites this paper
• Identity-Based Linkable Ring Signatures From Lattices

  2021cites this paper
• Implementation of Lattice Trapdoors on Modules and Applications

  2021cites this paper
• Short Identity-Based Signatures with Tight Security from Lattices

  2021cites this paper
• Chapter Four - Provably secure verifier-based password authenticated key exchange based on lattices

  2021cites this paper
• Cerebro: A Platform for Multi-Party Cryptographic Collaborative Learning

  2021cites this paper
• On Algebraic Embedding for Unstructured Lattices

  2021cites this paper
• Blockchain Technology: Can Data Security Change Higher Education Much Better?

  2021cites this paper
• Cyclic and well-rounded lattices

  2021cites this paper
• On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography

  2021cites this paper
• On the (M)iNTRU Assumption in the Integer Case

  2021cites this paper
• Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity

  2021cites this paper
• A survey on NIST PQ signatures

  2021cites this paper
• More Efficient Construction of Anonymous Signatures

  2021cites this paper
• Linkable Attribute-based Signature

  2021cites this paper
• Verifiable Decryption in the Head

  2021cites this paper
• Vector and Functional Commitments from Lattices

  2021cites this paper
• Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy

  2020cites this paper
• On the ideal shortest vector problem over random rational primes

  2020cites this paper
• Lattice-Based Cryptosystems: A Design Perspective

  2020cites this paper
• Incompressible Encodings

  2020cites this paper
• Random Self-reducibility of Ideal-SVP via Arakelov Random Walks

  2020cites this paper
• Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions

  2020cites this paper
• Practical Product Proofs for Lattice Commitments

  2020influential citation
• One-Time and Interactive Aggregate Signatures from Lattices

  2020cites this paper
• Mathematical Aspects of Computer and Information Sciences: 8th International Conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019, Revised Selected Papers

  2020cites this paper
• SKCN: Practical and Flexible Digital Signature from Module Lattice

  2020cites this paper