Aggregated Set Membership Proofs: Aggregated Signature-Based Set Membership Proofs and implementation in Client and Server Verifiable Additive Homomorphic Secret Sharing
| dc.contributor.author | Ek, Hanna | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Mitrokotsa, Katerina | |
| dc.contributor.supervisor | Mitrokotsa, Katerina | |
| dc.contributor.supervisor | Tsaloli, Georgia | |
| dc.date.accessioned | 2021-11-16T12:51:34Z | |
| dc.date.available | 2021-11-16T12:51:34Z | |
| dc.date.issued | 2021 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | This thesis addresses the issue of inflated computational complexity for the verification of multiple zero-knowledge proofs. More precisely, verification of numerous zero-knowledge set membership proofs performed by a single verifier is considered. To reduce the computations required by such a verifier Aggregated Set Membership Proofs are introduced. Aggregated set membership proofs unifies multiple set membership proofs into one aggregated proof, such that the validity of the aggregated proof implies the validity of all individual proofs. Completeness, soundness and zero-knowledge requirements are established for zero-knowledge aggregated set membership proofs. A concrete construction of aggregated set membership proofs is presented and proved to satisfy the completeness, soundness and zero-knowledge requirements. The construction is a partial aggregation of signature-based set membership proofs, [5], and is referred to as aggregated signature-based set membership proofs. A general technique to verify clients in verifiable additive homomorphic secret sharing is derived. The clients are verified by computing zero-knowledge proofs, derived from Pedersen commitments, of some given statement and then the proofs are validated by a verifier. If the proved statement is that the shared secrets belong to a discrete set, clients construct set membership proofs. Usually, several clients participate in verifiable additive homomorphic secret sharing protocols resulting in that the verification of clients is computationally expensive. A prototype implementation considering 100 clients showed that the runtime for verification of clients was reduced by 13% when verifying an aggregated signature-based set membership proof compared to verifying the same proofs without performing the aggregation. | sv |
| dc.identifier.coursecode | DATX05 | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/304361 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | Aggregated Set Membership Proofs | sv |
| dc.subject | Zero-knowledge proofs | sv |
| dc.subject | VAHSS | sv |
| dc.subject | cryptography | sv |
| dc.title | Aggregated Set Membership Proofs: Aggregated Signature-Based Set Membership Proofs and implementation in Client and Server Verifiable Additive Homomorphic Secret Sharing | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H |