Certificate validation in secure computation and its use in verifiable linear programming

DOI10.1007/978-3-319-31517-1_14zbMATH Open1404.94126OpenAlexW2464870988MaRDI QIDQ2814714FDOQ2814714

Authors: Sebastiaan de Hoogh, Berry Schoenmakers, Meilof Veeningen 

Publication date: 22 June 2016

Published in: Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31517-1_14

Recommendations

• Solving Linear Programs Using Multiparty Computation
• Verifiable multi-party computation with perfectly private audit trail
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation

Mathematics Subject Classification ID

Linear programming (90C05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (3)

• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• \(\mathcal H\)-OCSP: A protocol to reduce the processing burden in online certificate status validation
• Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation

This page was built for publication: Certificate validation in secure computation and its use in verifiable linear programming

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