Fully-succinct multi-key homomorphic signatures from standard assumptions
From MaRDI portal
(Redirected from Publication:6652902)
Recommendations
- Matrioska: a compiler for multi-key homomorphic signatures
- Multi-key homomorphic signatures unforgeable under insider corruption
- A compiler for multi-key homomorphic signatures for Turing machines
- Leveled fully homomorphic signatures from standard lattices
- The simplest multi-key linearly homomorphic signature scheme
Cites work
- A compiler for multi-key homomorphic signatures for Turing machines
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Chainable functional commitments for unbounded-depth circuits
- Context hiding multi-key linearly homomorphic authenticators
- Correlation intractability and SNARGs from sub-exponential DDH
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Efficient network coding signatures in the standard model
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic message authenticators
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Homomorphic network coding signatures in the standard model
- Homomorphic signatures for polynomial functions
- Homomorphic signatures with efficient verification for polynomial functions
- How to delegate computations publicly
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- Improved security for linearly homomorphic signatures: a generic framework
- Lattice-based functional commitments: fast verification and cryptanalysis
- Leveled fully homomorphic signatures from standard lattices
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Matrioska: a compiler for multi-key homomorphic signatures
- Multi-key Homomorphic Authenticators
- Multi-key homomorphic signatures unforgeable under insider corruption
- New realizations of somewhere statistically binding hashing and positional accumulators
- Non-interactive batch arguments for NP from standard assumptions
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- On the (in)security of SNARKs in the presence of oracles
- On the communication complexity of secure function evaluation with long output
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Secure network coding over the integers
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- The simplest multi-key linearly homomorphic signature scheme
- Vector commitments and their applications
Cited in
(6)- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- Pairing-based batch arguments for NP with a linear-size CRS
- Lattice-based multi-key homomorphic signatures forward-unforgeable against signing key leakage
- Pairing-based functional commitments for circuits with shorter parameters
This page was built for publication: Fully-succinct multi-key homomorphic signatures from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652902)
