Universally verifiable multiparty computation from threshold homomorphic cryptosystems
From MaRDI portal
Recommendations
- Advances in Cryptology - CRYPTO 2003
- scientific article; zbMATH DE number 1808209
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
Cites work
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Advances in Cryptology - CRYPTO 2003
- Efficient Binary Conversion for Paillier Encrypted Values
- Efficient threshold zero-knowledge with applications to user-centric protocols
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1676659 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1023994 (Why is no real title available?)
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Two-Party Computation Based on the Conditional Gate
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Publicly auditable secure multi-party computation
- Random Oracles and Auxiliary Input
- Reusable garbled circuits and succinct functional encryption
- Secure Arithmetic Computation with No Honest Majority
- Secure multiparty computation goes live
- Security and composition of multiparty cryptographic protocols
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Zero knowledge in the random oracle model, revisited
Cited in
(19)- Perennial secure multi-party computation of universal Turing machine
- Efficient constant-round MPC with identifiable abort and public verifiability
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Universally verifiable MPC and IRV ballot counting
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Verifiable computation in multiparty protocols with honest majority
- Secure outsourced computation
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- Advances in Cryptology - CRYPTO 2003
- Function-Dependent Commitments for Verifiable Multi-party Computation
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Secure multiparty computation from threshold encryption based on class groups
- SCRAPE: scalable randomness attested by public entities
- OCash: fully anonymous payments between blockchain light clients
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
This page was built for publication: Universally verifiable multiparty computation from threshold homomorphic cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794490)
