Fully-succinct multi-key homomorphic signatures from standard assumptions
From MaRDI portal
Publication:6652902
DOI10.1007/978-3-031-68382-4_10MaRDI QIDQ6652902
Gaspard Anthoine, David Balbás, Dario Fiore
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-key homomorphic signatures unforgeable under insider corruption
- Matrioska: a compiler for multi-key homomorphic signatures
- Non-interactive batch arguments for NP from standard assumptions
- A compiler for multi-key homomorphic signatures for Turing machines
- The simplest multi-key linearly homomorphic signature scheme
- Context hiding multi-key linearly homomorphic authenticators
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Multi-key Homomorphic Authenticators
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Homomorphic Signatures for Polynomial Functions
- Homomorphic Network Coding Signatures in the Standard Model
- On the (In)Security of SNARKs in the Presence of Oracles
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Secure Network Coding over the Integers
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Vector Commitments and Their Applications
- Fully homomorphic encryption using ideal lattices
- How to delegate computations publicly
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
- Chainable functional commitments for unbounded-depth circuits
- Lattice-based functional commitments: fast verification and cryptanalysis
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
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)
