Paper 2021/1656
Efficient Set Membership Proofs using MPC-in-the-Head
Aarushi Goel, Matthew Green, Mathias Hall-Andersen, and Gabriel Kaptchuk
Abstract
Set membership proofs are an invaluable part of privacy preserving systems. These proofs allow a prover to demonstrate knowledge of a witness
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Privacy Enhancing Technologies Symposium 2022
- Keywords
- Zero-knowledgeRing SignaturesSet MembershipConfidential Transactions
- Contact author(s)
-
aarushig @ cs jhu edu
mgreen @ cs jhu edu
ma @ cs au dk
kaptchuk @ bu edu - History
- 2021-12-22: last of 4 revisions
- 2021-12-17: received
- See all versions
- Short URL
- https://ia.cr/2021/1656
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1656, author = {Aarushi Goel and Matthew Green and Mathias Hall-Andersen and Gabriel Kaptchuk}, title = {Efficient Set Membership Proofs using {MPC}-in-the-Head}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1656}, year = {2021}, url = {https://eprint.iacr.org/2021/1656} }