Multi-key fully-homomorphic aggregate MAC for arithmetic circuits

DOI10.1007/978-3-031-80308-6_10MaRDI QIDQ6955341zbMATH OpenFDO

Authors Suvasree Biswas, Arkady Yerukhimovich

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-80308-6_10

zbMATH Keywords

aggregate MAChomomorphic authenticatorsverifiable computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A probabilistic remark on algebraic program testing
• Aggregate Message Authentication Codes
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Demystifying the border of depth-3 algebraic circuits
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• From secrecy to soundness: efficient verification via secure computation (extended abstract)
• Fully homomorphic message authenticators
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• Homomorphic signatures for polynomial functions
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2079932 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• Improved delegation of computation using fully homomorphic encryption
• Leveled fully homomorphic signatures from standard lattices
• Multi-key Homomorphic Authenticators
• Multi-key homomorphic signatures unforgeable under insider corruption
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Practical homomorphic MACs for arithmetic circuits
• Quadratic span programs and succinct NIZKs without PCPs
• Separating succinct non-interactive arguments from all falsifiable assumptions
• The exact security of digital signatures -- how to sign with RSA and Rabin
• Unrestricted Aggregate Signatures
• Verifiable delegation of computation over large datasets

This page was built for publication: Multi-key fully-homomorphic aggregate MAC for arithmetic circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955341)