Function-Dependent Commitments for Verifiable Multi-party Computation

DOI10.1007/978-3-319-99136-8_16MaRDI QIDQ6108843zbMATH OpenOpenAlexFDO

Authors Lucas Schabhüser, Denis Butin, Denise Demirel, Johannes Buchmann

Publication date 30 June 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99136-8_16

zbMATH Keywords

MPChomomorphic cryptographycommitments

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Internet topics (68M11) Privacy of data (68P27)

Recommendations

• Function-dependent commitments from homomorphic authenticators
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• Verifiable computation in multiparty protocols with honest majority
• Functional encryption with bounded collusions via multi-party computation
• Computationally sound abstraction and verification of secure multi-party computations
• Multi-client verifiable computation with stronger security guarantees
• scientific article; zbMATH DE number 1405691
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments

Cites work

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• Delegatable homomorphic encryption with applications to secure outsourcing of computation
• Efficient network coding signatures in the standard model
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• Functional signatures and pseudorandom functions
• Generalizing homomorphic MACs for arithmetic circuits
• Homomorphic network coding signatures in the standard model
• Homomorphic signatures with efficient verification for polynomial functions
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• How to share a secret
• Identity-Based Encryption from the Weil Pairing
• Improved security for linearly homomorphic signatures: a generic framework
• Linearly homomorphic authenticated encryption with provable correctness and public verifiability
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
• Publicly auditable secure multi-party computation
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems

Cited in

(2)

• Secure publicly verifiable computation with polynomial commitment in cloud computing
• Function-dependent commitments from homomorphic authenticators

This page was built for publication: Function-Dependent Commitments for Verifiable Multi-party Computation

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