| Autor: |
Goel, Aarushi, Green, Matthew, Hall-Andersen, Mathias Nørup, Kaptchuk, Gabriel |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Goel, A, Green, M, Hall-Andersen, M N & Kaptchuk, G 2022, ' Efficient Set Membership Proofs using MPC-in-the-Head ', Proceedings on Privacy Enhancing Technologies, vol. 2022, no. 2, pp. 304-324 . https://doi.org/10.2478/popets-2022-0047 |
| DOI: |
10.2478/popets-2022-0047 |
| Popis: |
Set membership proofs are an invaluable part of privacy preserving systems. These proofs allow a prover to demonstrate knowledge of a witness corresponding to a secret element x of a public set, such that they jointly satisfy a given NP relation, i.e. R(w, x) = 1 and is a member of a public set {x1, ..., xl}. This allows the identity of the prover to remain hidden, eg. ring signatures and confidential transactions in cryptocurrencies.In this work, we develop a new technique for efficiently adding logarithmic-sized set membership proofs to any MPC-in-the-head based zero-knowledge protocol (Ishai et al. [STOC'07]). We integrate our technique into an open source implementation of the state-of-the-art, post quantum secure zero-knowledge protocol of Katz et al. [CCS'18]. We find that using our techniques to construct ring signatures results in signatures (based only on symmetric key primitives) that are between 5 and 10 times smaller than state-of-the-art techniques based on the same assumptions. We also show that our techniques can be used to efficiently construct post-quantum secure RingCT from only symmetric key primitives. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
