Compute, but verify: efficient multiparty computation over authenticated inputs

DOI10.1007/978-981-96-0938-3_5MaRDI QIDQ6965201zbMATH OpenFDO

Authors Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, N. K. Singh

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0938-3_5

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)

Cites work

• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Aurora: transparent succinct arguments for R1CS
• Broadcast Extensions with Optimal Communication and Round Complexity
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Constant-Size Dynamic k-TAA
• Distributed Provers with Applications to Undeniable Signatures
• Efficient signature generation by smart cards
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Enforcing input correctness via certification in garbled circuit evaluation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• Improved signature schemes for secure multi-party computation with certified inputs
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Multiparty Computation from Somewhat Homomorphic Encryption
• On garbling schemes with and without privacy
• On the (in)security of ROS
• On the (in)security of SNARKs in the presence of oracles
• On the size of pairing-based non-interactive arguments
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Scalable and Unconditionally Secure Multiparty Computation
• Short randomizable signatures
• Theory of Cryptography
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(1)

• Laconic PSI on authenticated inputs and applications

This page was built for publication: Compute, but verify: efficient multiparty computation over authenticated inputs

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