Leveled Fully Homomorphic Signatures from Standard Lattices
From MaRDI portal
Publication:2941539
DOI10.1145/2746539.2746576zbMath1321.94062OpenAlexW2071676384MaRDI QIDQ2941539
Daniel Wichs, Vinod Vaikuntanathan, Sergey Gorbunov
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/112962
Related Items (66)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Adaptively secure distributed PRFs from LWE ⋮ On the statistical leak of the GGH13 multilinear map and some variants ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Delegating RAM Computations ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Batch verifiable computation of outsourced functions ⋮ Efficient and fully secure lattice-based IBE with equality test ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Multi-key Homomorphic Authenticators ⋮ Succinct classical verification of quantum computation ⋮ Structure-preserving linearly homomorphic signature with designated combiner for subspace ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ A note on the post-quantum security of (ring) signatures ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Triply adaptive UC NIZK ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Lattice-based programmable hash functions and applications ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ Adaptively secure inner product encryption from LWE ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Vector and functional commitments from lattices ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Simulatable verifiable random function from the LWE assumption ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Verifiable pattern matching on outsourced texts ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Cryptography with Updates ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ 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 ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ FHE Circuit Privacy Almost for Free ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Progressive and efficient verification for digital signatures ⋮ Homomorphic Encryption
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Leveled Fully Homomorphic Signatures from Standard Lattices
