Joint encryption and message-efficient secure computation
The article is about message complexity for \(n\) parties to evaluate a circuit privately, i.e. in such a way that no subset of participants can extract useful information about the other participant's input. To solve the problem ideas from group-oriented cryptography are used in a novel way. Particularly a new ``joint encryption scheme having some desirable properties not found in previously published schemes is proposed. Subsequently the scheme is used in a circuit evaluation protocol using only \(O(nC)\) encrypted bits of communication for size \(C\) circuit. Previously known circuit evaluation protocols used \(O(n^2 C)\) encrypted bits of communication, thus the new result represents significant improvement. In the final section of the paper this improvement is discussed in the light of a model used particularly with respect to ``writer vs. ``reader measure (for reading a single broadcasted encrypted bit by \(m\) parties the protocol is charged one vs. \(m\) encrypted bits).
- Dynamic and efficient joint encryption scheme in the plain public key model
- Multi-party threshold private set intersection with sublinear communication
- Actively secure setup for SPDZ
- Asynchronous Multi-Party Computation with Quadratic Communication
- scientific article; zbMATH DE number 1024062 (Why is no real title available?)
- Theory of Cryptography
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Towards practical topology-hiding computation
- Fast secure computations on shared polynomials and applications to private set operations
- Correction to: ``Actively secure setup for SPDZ
- Revisiting module lattice-based homomorphic encryption and application to secure-MPC
This page was built for publication: Joint encryption and message-efficient secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563544)
