Trapdoors for hard lattices and new cryptographic constructions
From MaRDI portal
Publication:3549701
DOI10.1145/1374376.1374407zbMath1231.68124OpenAlexW2038761522MaRDI QIDQ3549701
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
Publication date: 5 January 2009
Published in: Proceedings of the fortieth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1374376.1374407
Related Items
BLOOM: bimodal lattice one-out-of-many proofs and applications, Subfield attacks on HSVP in ideal lattices, On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices, Identity-based interactive aggregate signatures from lattices, Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields, Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler, New and improved constructions for partially equivocable public key encryption, Cumulatively all-lossy-but-one trapdoor functions from standard assumptions, Identity-based matchmaking encryption from standard assumptions, On module unique-SVP and NTRU, Another round of breaking and making quantum money: how to not build it from lattices, and more, From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments, (Inner-product) functional encryption with updatable ciphertexts, A framework for practical anonymous credentials from lattices, Generic constructions of master-key KDM secure attribute-based encryption, A fully secure lattice-based signcryption with designated equality test in standard model, Candidate witness encryption from lattice techniques, On the hardness of the NTRU problem, How to build a trapdoor function from an encryption scheme, Identity-Based Encryption Resilient to Auxiliary Leakage under the Decisional Linear Assumption, Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding, Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits, A New Design of Online/Offline Signatures Based on Lattice, A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion, Forward-secure revocable secret handshakes from lattices, Post-quantum asynchronous deniable key exchange and the signal handshake, Efficient lattice-based inner-product functional encryption, Public-key encryption from homogeneous CLWE, How to sample a discrete Gaussian (and more) from a random oracle, Simplified server-aided revocable identity-based encryption from lattices, Zero-knowledge range arguments for signed fractional numbers from lattices, Spatial encryption revisited: from delegatable multiple inner product encryption and more, Public key authenticated encryption with keyword search from LWE, Lattice-based programmable hash functions and applications, Lattice-based cryptography: a survey, Quantum search-to-decision reduction for the LWE problem, Lattice-based succinct arguments from vanishing polynomials (extended abstract), \textsf{Orbweaver}: succinct linear functional commitments from lattices, Learning with physical rounding for linear and quadratic leakage functions, Compact lattice gadget and its applications to hash-and-sign signatures, Lattice-based authenticated key exchange with tight security, \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation, A lower bound for proving hardness of learning with rounding with polynomial modulus, HRA-secure attribute-based threshold proxy re-encryption from lattices, \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography, Traceable policy-based signatures and instantiation from lattices, A lattice-based forward secure IBE scheme for Internet of things, Hardness of (M)LWE with semi-uniform seeds, Masking the GLP lattice-based signature scheme at any order, Classical Homomorphic Encryption for Quantum Circuits, An efficient IBE scheme with tight security reduction in the random oracle model, Cryptanalysis and improvement of verifiable quantum \((k,n)\) secret sharing, On random nonsingular Hermite normal form, Comment on ``A strong provably secure IBE scheme without bilinear map by M. Zheng, Y. Xiang and H. Zhou, Lattice-based key exchange on small integer solution problem, SoK: how (not) to design and implement post-quantum cryptography, On the hardness of module-LWE with binary secret, Lattice-based linearly homomorphic signatures in the standard model, (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps, Efficient subtree-based encryption for fuzzy-entity data sharing, Signature schemes secure against hard-to-invert leakage, On basing search SIVP on \(\mathbf{NP}\)-hardness, Adaptively secure distributed PRFs from LWE, Return of GGH15: provable security against zeroizing attacks, Lattice-based certificateless encryption scheme, Policy-based signature scheme from lattices, Tightly secure signatures from lossy identification schemes, Regular lossy functions and their applications in leakage-resilient cryptography, On the ring-LWE and polynomial-LWE problems, Faster Gaussian sampling for trapdoor lattices with arbitrary modulus, Anonymous IBE, leakage resilience and circular security from new assumptions, A novel model for lattice-based authorized searchable encryption with special keyword, Bonsai trees, or how to delegate a lattice basis, Finding shortest lattice vectors faster using quantum search, PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials, New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors, Hardness of \(k\)-LWE and applications in traitor tracing, Shorter identity-based encryption via asymmetric pairings, Gaussian sampling of lattices for cryptographic applications, On the asymptotic complexity of solving LWE, Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures, Cryptanalysis and improvement of a quantum private set intersection protocol, Programmable hash functions and their applications, Practical fully secure unrestricted inner product functional encryption modulo \(p\), Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption, A lattice-based identity-based proxy blind signature scheme in the standard model, An efficient homomorphic aggregate signature scheme based on lattice, Efficient selective identity-based encryption without random oracles, Public key compression for constrained linear signature schemes, Provably secure NTRUEncrypt over any cyclotomic field, Minimal condition for shortest vectors in lattices of low dimension, Algebraic (trapdoor) one-way functions: constructions and applications, Optimal security proofs for full domain hash. Revisited, A lattice-based group signature scheme with verifier-local revocation, A simple provably secure AKE from the LWE problem, Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance, Security analysis of cryptosystems using short generators over ideal lattices, A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE, Generating shorter bases for hard random lattices, A more efficient leveled strongly-unforgeable fully homomorphic signature scheme, On the structure of Boolean functions with small spectral norm, Confined guessing: new signatures from standard assumptions, A framework for cryptographic problems from linear algebra, Towards a ring analogue of the leftover hash lemma, Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model, Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key, Adaptively secure distributed PRFs from \(\mathsf{LWE}\), Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity, Sampling from discrete Gaussians for lattice-based cryptography on a constrained device, Revocable attribute-based proxy re-encryption, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems, Verifiable single-server private information retrieval from LWE with binary errors, Optimal broadcast encryption from pairings and LWE, Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices, Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes, Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512, Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures, Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}, Post-quantum multi-party computation, A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP, New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts, Classical vs quantum random oracles, Multiparty reusable non-interactive secure computation from LWE, Unbounded multi-party computation from learning with errors, Generic construction of server-aided revocable hierarchical identity-based encryption, An efficient CCA-secure access control encryption for any policy, Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption, A lattice-based fully dynamic group signature scheme without NIZK, Banquet: short and fast signatures from AES, Exact lattice sampling from non-Gaussian distributions, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Updatable signatures and message authentication codes, Round-optimal verifiable oblivious pseudorandom functions from ideal lattices, Identity-based encryption with security against the KGC: a formal model and its instantiations, Wildcarded identity-based encryption from lattices, LWE from non-commutative group rings, Chosen-ciphertext lattice-based public key encryption with equality test in standard model, On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers, Incompressible encodings, Dynamic decentralized functional encryption, Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP, Random self-reducibility of ideal-SVP via Arakelov random walks, Slide reduction, revisited -- filling the gaps in SVP approximation, Rounding in the rings, A non-PCP approach to succinct quantum-safe zero-knowledge, An optimized GHV-type HE scheme: simpler, faster, and more versatile, Progressive and efficient verification for digital signatures, Covert authentication from lattices, Efficient and tight oblivious transfer from PKE with tight multi-user security, Attribute-Based Keyword Search from Lattices, Generic Constructions of Revocable Identity-Based Encryption, PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model, Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography, Isochronous Gaussian Sampling: From Inception to Implementation, Decryption Failure Is More Likely After Success, Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions, COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers, Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography, Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber, Two-Round Oblivious Linear Evaluation from Learning with Errors, Towards a Simpler Lattice Gadget Toolkit, Ring Trapdoor Redactable Signatures from Lattice, Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem, A Novel Certificateless Multi-signature Scheme over NTRU Lattices, An Inequality for Gaussians on Lattices, Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy, Bounded Collusion ABE for TMs from IBE, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Lattice-based accumulator with constant time list update and constant time verification, Improved power analysis attacks on Falcon, Functional commitments for all functions, with transparent setup and from SIS, Succinct vector, polynomial, and functional commitments from lattices, Efficient laconic cryptography from learning with errors, Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice, Unidirectional updatable encryption and proxy re-encryption from DDH, A lightweight identification protocol based on lattices, A key-recovery attack against Mitaka in the \(t\)-probing model, Identity-based encryption in DDH hard groups, Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract), Shorter hash-and-sign lattice-based signatures, Multimodal private signatures, Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation, Fiat-Shamir signatures based on module-NTRU, Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs, Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions, Efficient unique ring signatures from lattices, Puncturable signature: a generic construction and instantiations, Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors, More efficient adaptively secure lattice-based IBE with equality test in the standard model, Classical reduction of gap SVP to LWE: a concrete security analysis, A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels, Lattice-based signatures with tight adaptive corruptions and more, A note on the post-quantum security of (ring) signatures, Efficient lattice-based blind signatures via Gaussian one-time signatures, Multi-authority ABE from lattices without random oracles, Forward-secure encryption with fast forwarding, Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance, Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities, \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple, Attacks on the Search RLWE Problem with Small Errors, Collusion Resistant Traitor Tracing from Learning with Errors, Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP), Explicit Hard Instances of the Shortest Vector Problem, Deterministic compression with uncertain priors, Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs, Thrackles: An Improved Upper Bound, Discrete Gaussian Distributions via Theta Functions, Identity-based blind signature from lattices, Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, On the Semantic Security of Functional Encryption Schemes, Improved (Hierarchical) Inner-Product Encryption from Lattices, Chosen-Ciphertext Secure Fully Homomorphic Encryption, Provably Secure NTRU Instances over Prime Cyclotomic Rings, One-Shot Verifiable Encryption from Lattices, Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE, Group signatures and more from isogenies and lattices: generic, simple, and efficient, Cryptographic Functions from Worst-Case Complexity Assumptions, The truth behind the myth of the folk theorem, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Rigorous and Efficient Short Lattice Vectors Enumeration, Expanders with respect to Hadamard spaces and random graphs, Limits of local algorithms over sparse random graphs, Watermarking cryptographic functionalities from standard lattice assumptions, Learning strikes again: the case of the DRS signature scheme, Multi-theorem preprocessing NIZKs from lattices, Generic constructions of integrated PKE and PEKS, Tighter security proofs for GPV-IBE in the quantum random oracle model, Improvements in the analysis of Kannan's CVP algorithm, Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model, Algebraic Attacks Against Several Weak Variants of GVW’13 ABE, Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices, Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices, Adaptive oblivious transfer with access control from lattice assumptions, Realizing Hash-and-Sign Signatures under Standard Assumptions, Minicrypt primitives with algebraic structure and applications, Adaptively secure MPC with sublinear communication complexity, Hardness of bounded distance decoding on lattices in lp norms, Kissing Numbers and Transference Theorems from Generalized Tail Bounds, Algorithms for the Generalized NTRU Equations and their Storage Analysis, Unnamed Item, Mixing time and eigenvalues of the abelian sandpile Markov chain, Unnamed Item, Survey of Lattice-Based Group Signature, Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting, Lattice-based linearly homomorphic signature scheme over binary field, Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance, Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption, Cryptanalyses of Candidate Branching Program Obfuscators, Cryptography from Learning Parity with Noise, Fully Homomorphic Encryption with Auxiliary Inputs, Trapdoors for Ideal Lattices with Applications, Approximate-Deterministic Public Key Encryption from Hard Learning Problems, Deniable Attribute Based Encryption for Branching Programs from LWE, Targeted Homomorphic Attribute-Based Encryption, On the Efficacy of Solving LWE by Reduction to Unique-SVP, Lattice Point Enumeration on Block Reduced Bases, Augmented Learning with Errors: The Untapped Potential of the Error Term, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, Towards Tightly Secure Lattice Short Signature and Id-Based Encryption, From Identification to Signatures, Tightly: A Framework and Generic Transforms, Multi-key Homomorphic Authenticators, Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps, Computational Security of Quantum Encryption, Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Secret handshakes: full dynamicity, deniability and lattice-based design, Simulatable verifiable random function from the LWE assumption, Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling, Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World, Identity-Based Blind Signature from Lattices in Standard Model, Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based, A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$, Lattice-based FHE as secure as PKE, Cryptogenography, Limits of random oracles in secure computation, Non-commutative arithmetic circuits with division, Decision trees, protocols and the entropy-influence conjecture, Locally testable codes and cayley graphs, Invitation games and the price of stability, Welfare maximization and truthfulness in mechanism design with ordinal preferences, Coordination mechanisms from (almost) all scheduling policies, Private interactive communication across an adversarial channel, Tree codes and a conjecture on exponential sums, Capacity of non-malleable codes, Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications, Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements, Sequential decision making with vector outcomes, Learning mixtures of arbitrary distributions over large discrete domains, Why do simple algorithms for triangle enumeration work in the real world?, Black-box obfuscation for d-CNFs, Candidate weak pseudorandom functions in AC 0 ○ MOD 2, Iterated group products and leakage resilience against NC1, Building one-time memories from isolated qubits, Attribute-efficient evolvability of linear functions, Energy-efficient circuit design, Rate-independent computation in continuous chemical reaction networks, Testers and their applications, On the automorphism groups of strongly regular graphs I, Faster private release of marginals on small databases, Mechanism design in large games, Redrawing the boundaries on purchasing data from privacy-sensitive individuals, Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems, Complexity of approximating CSP with balance / hard constraints, Integer feasibility of random polytopes, Multireference alignment using semidefinite programming, Partial tests, universal tests and decomposability, High dimensional expanders and property testing, Parameterized testability, Direct sum fails for zero error average communication, Rational arguments, Secure multi-source network coding scheme with lattice signature, Two Efficient Tag-Based Encryption Schemes on Lattices, Compact Inner Product Encryption from LWE, Compact Hierarchical IBE from Lattices in the Standard Model, An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem, Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption, Simplified Revocable Hierarchical Identity-Based Encryption from Lattices, Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease, Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting, Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map, Finding Shortest Lattice Vectors in the Presence of Gaps, Reconfigurable Cryptography: A Flexible Approach to Long-Term Security, Cryptographic Assumptions: A Position Paper, Decompositions of Triangle-Dense Graphs, Lattice-based identity-based resplittable threshold public key encryption scheme, Better Key Sizes (and Attacks) for LWE-Based Encryption, One-Time Signatures and Chameleon Hash Functions, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, One-Round Strong Oblivious Signature-Based Envelope, Classical Homomorphic Encryption for Quantum Circuits, The Geometry of Lattice Cryptography, A Lattice-Based Group Signature Scheme with Message-Dependent Opening, Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions, Parallel Implementation of BDD Enumeration for LWE, The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs, FHE Circuit Privacy Almost for Free, Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE, Circular Security Separations for Arbitrary Length Cycles from LWE, Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security, On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, Authenticated Byzantine Generals in Dual Failure Model, Public-Key Encryption Schemes with Auxiliary Inputs, Public-Key Cryptographic Primitives Provably as Secure as Subset Sum, New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts, Compact ring signatures from learning with errors, A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency, A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs, How to meet ternary LWE keys, Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance, Lower bounds on lattice sieving and information set decoding, Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security, An improved exact sampling algorithm for the standard normal distribution, An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption, Extended dual system group and shorter unbounded hierarchical identity based encryption, Does Fiat-Shamir require a cryptographic hash function?, Attribute-based access control for inner product functional encryption from LWE, Attribute-based conditional proxy re-encryption in the standard model under LWE, Lattice-based HRA-secure attribute-based proxy re-encryption in standard model, Black-box accumulation based on lattices, On the higher-bit version of approximate inhomogeneous short integer solution problem, Survey of information security, On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes, Gadget-based iNTRU lattice trapdoors, Post-quantum cryptography: lattice signatures, Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems, Ciphertext-only attacks against compact-LWE submitted to NIST PQC project, Puncturable identity-based and attribute-based encryption from lattices, A note on the concrete hardness of the shortest independent vector in lattices, A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme, Anamorphic encryption: private communication against a dictator, One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model, Dynamic collusion bounded functional encryption from identity-based encryption, \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}, Quantum algorithms for variants of average-case lattice problems via filtering, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes, Attribute-based proxy re-encryption from standard lattices, Scalable revocable identity-based signature over lattices in the standard model, Duplication free public keys based on SIS-type problems, Lattice trapdoors and IBE from middle-product LWE, Matrix PRFs: constructions, attacks, and applications to obfuscation, Compressible FHE with applications to PIR, Short signatures from Diffie-Hellman: realizing almost compact public key, On the smoothing parameter and last minimum of random orthogonal lattices, Post-quantum online voting scheme, Asymptotically efficient lattice-based digital signatures, Lattice-based secret handshakes with reusable credentials, More efficient construction of anonymous signatures, Estimation of the hardness of the learning with errors problem with a restricted number of samples, Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, A novel identity-based multi-signature scheme over NTRU lattices, Quantum algorithms for typical hard problems: a perspective of cryptanalysis, On the hardness of module learning with errors with short distributions, Improved analysis of the reduction from BDD to uSVP, Forward-secure ID based digital signature scheme with forward-secure private key generator, Improved broadcast attacks against subset sum problems via lattice oracle, Improving convergence and practicality of slide-type reductions, Cryptanalysis of a code-based one-time signature, Identity-based key-exposure resilient cloud storage public auditing scheme from lattices, Adaptively secure inner product encryption from LWE, Inner-product functional encryption with fine-grained access control, CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors, Non-committing encryption with constant ciphertext expansion from standard assumptions, Towards classical hardness of module-LWE: the linear rank case, Acyclicity programming for sigma-protocols, ABE for DFA from LWE against bounded collusions, revisited, Ring-based identity based encryption -- asymptotically shorter MPK and tighter security, Updatable public key encryption in the standard model, Vector and functional commitments from lattices, On the (M)iNTRU assumption in the integer case, Direct computation of branching programs and its applications to more efficient lattice-based cryptography, On the probability of generating a lattice, Group signature from lattices preserving forward security in dynamic setting, Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage, Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more, An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice, Lattice-based completely non-malleable public-key encryption in the standard model, Speeding-up verification of digital signatures, Trapdoor delegation and HIBE from middle-product LWE in standard model, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions, Efficient public-key encryption with equality test from lattices, On the complexity of the BKW algorithm on LWE, Novel updatable identity-based hash proof system and its applications, Identity-based proxy re-signatures from lattices, A lattice-based signcryption scheme without random oracles, Modular lattice signatures, revisited, Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes, Cryptanalysis of a rank-based signature with short public keys, Quantum-resistant identity-based signature with message recovery and proxy delegation, Lattice-based group signatures: achieving full dynamicity (and deniability) with ease, A new Gaussian sampling for trapdoor lattices with arbitrary modulus, Lattice-based revocable certificateless signature, Strongly unforgeable ring signature scheme from lattices in the standard model, Worst-case to average-case reductions for module lattices, Password protected secret sharing from lattices, Implementation of lattice trapdoors on modules and applications, Verifying post-quantum signatures in 8 kB of RAM, Short identity-based signatures with tight security from lattices, On removing rejection conditions in practical lattice-based signatures, Secure hybrid encryption in the standard model from hard learning problems, Key-homomorphic pseudorandom functions from LWE with small modulus, Integral matrix Gram root and lattice Gaussian sampling without floats
Uses Software
