TY - GEN
T1 - Private Polynomial Commitments and Applications to MPC
AU - Bhadauria, Rishabh
AU - Hazay, Carmit
AU - Venkitasubramaniam, Muthuramakrishnan
AU - Wu, Wenxuan
AU - Zhang, Yupeng
N1 - Publisher Copyright: © 2023, International Association for Cryptologic Research.
PY - 2023
Y1 - 2023
N2 - Polynomial commitment schemes allow a prover to commit to a polynomial and later reveal the evaluation of the polynomial on an arbitrary point along with proof of validity. This object is central in the design of many cryptographic schemes such as zero-knowledge proofs and verifiable secret sharing. In the standard definition, the polynomial is known to the prover whereas the evaluation points are not private. In this paper, we put forward the notion of private polynomial commitments that capture additional privacy guarantees, where the evaluation points are hidden from the verifier while the polynomial is hidden from both. We provide concretely efficient constructions that allow simultaneously batch the verification of many evaluations with a small additive overhead. As an application, we design a new concretely efficient multi-party private set-intersection with malicious security and improved asymptotic communication and space complexities. We demonstrate the concrete efficiency of our construction via an implementation. Our scheme can prove 2 10 evaluations of a private polynomial of degree 2 10 in 157 s. The proof size is only 169 KB and the verification time is 11.8 s. Moreover, we also implemented the multi-party private set intersection protocol and scale it to 1000 parties (which has not been shown before). The total running time for 2 14 elements per party is 2,410 s. While existing protocols offer better computational complexity, our scheme offers significantly smaller communication and better scalability (in the number of parties) owing to better memory usage.
AB - Polynomial commitment schemes allow a prover to commit to a polynomial and later reveal the evaluation of the polynomial on an arbitrary point along with proof of validity. This object is central in the design of many cryptographic schemes such as zero-knowledge proofs and verifiable secret sharing. In the standard definition, the polynomial is known to the prover whereas the evaluation points are not private. In this paper, we put forward the notion of private polynomial commitments that capture additional privacy guarantees, where the evaluation points are hidden from the verifier while the polynomial is hidden from both. We provide concretely efficient constructions that allow simultaneously batch the verification of many evaluations with a small additive overhead. As an application, we design a new concretely efficient multi-party private set-intersection with malicious security and improved asymptotic communication and space complexities. We demonstrate the concrete efficiency of our construction via an implementation. Our scheme can prove 2 10 evaluations of a private polynomial of degree 2 10 in 157 s. The proof size is only 169 KB and the verification time is 11.8 s. Moreover, we also implemented the multi-party private set intersection protocol and scale it to 1000 parties (which has not been shown before). The total running time for 2 14 elements per party is 2,410 s. While existing protocols offer better computational complexity, our scheme offers significantly smaller communication and better scalability (in the number of parties) owing to better memory usage.
UR - http://www.scopus.com/inward/record.url?scp=85161623356&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-031-31371-4_5
DO - https://doi.org/10.1007/978-3-031-31371-4_5
M3 - منشور من مؤتمر
SN - 9783031313707
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 127
EP - 158
BT - Public-Key Cryptography – PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
A2 - Boldyreva, Alexandra
A2 - Kolesnikov, Vladimir
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023
Y2 - 7 May 2023 through 10 May 2023
ER -