Theory of Cryptography
From MaRDI portal
Publication:5898646
DOI10.1007/11681878zbMath1112.94020OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898646
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Related Items (66)
Cyclic and well-rounded lattices ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Tightly secure signatures from lossy identification schemes ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Memory lower bounds of reductions revisited ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Post-quantum cryptography: lattice signatures ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Asymptotically quasi-optimal cryptography ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Lattice trapdoors and IBE from middle-product LWE ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Post-quantum online voting scheme ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ More efficient construction of anonymous signatures ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ Puncturable signature: a generic construction and instantiations ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ Lattice-based programmable hash functions and applications ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ On the (M)iNTRU assumption in the integer case ⋮ On the tightness of forward-secure signature reductions ⋮ On the geometry of cyclic lattices ⋮ A verifiable threshold secret sharing scheme based on lattices ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Short Bases of Lattices over Number Fields ⋮ Interpreting Hash Function Security Proofs ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ On the ideal shortest vector problem over random rational primes ⋮ On the security of homomorphic encryption on approximate numbers ⋮ The Geometry of Lattice Cryptography ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Strongly unforgeable ring signature scheme from lattices in the standard model ⋮ Incompressible encodings ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ Practical product proofs for lattice commitments ⋮ Lattice-based blind signatures, revisited ⋮ Permutation invariant lattices ⋮ A Parallel GPU Implementation of SWIFFTX ⋮ Unnamed Item ⋮ Improved lattice-based mix-nets for electronic voting ⋮ Worst-case to average-case reductions for module lattices ⋮ Implementation of lattice trapdoors on modules and applications
This page was built for publication: Theory of Cryptography
