Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes

Related Items (2)

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Sequential digital signatures for cryptographic software-update authentication

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Generating shorter bases for hard random lattices
(Leveled) fully homomorphic encryption without bootstrapping
Hardness of SIS and LWE with Small Parameters
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Low Overhead Broadcast Encryption from Multilinear Maps
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Lattice Signatures without Trapdoors
Circular and KDM Security for Identity-Based Encryption
Leveled Fully Homomorphic Signatures from Standard Lattices
Attribute-Based Signatures
On the Amortized Complexity of Zero-Knowledge Protocols
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Trapdoors for hard lattices and new cryptographic constructions
Efficient Lattice (H)IBE in the Standard Model
Generalized Compact Knapsacks Are Collision Resistant
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
Fully homomorphic encryption using ideal lattices
Public-key cryptosystems from the worst-case shortest vector problem
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Double-Authentication-Preventing Signatures
Functional Signatures and Pseudorandom Functions
Policy-Based Signatures
Lattice-Based Identification Schemes Secure Under Active Attacks
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Constant-Size ID-Based Linkable and Revocable-iff-Linked Ring Signature
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
Classical hardness of learning with errors
Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures
Theory of Cryptography
Theory of Cryptography
On lattices, learning with errors, random linear codes, and cryptography
Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes