Online/Offline OR Composition of Sigma Protocols
IACR Cryptology ePrint Archive, Volume 2016, 2016, Pages 63-92.
Proofs of partial knowledge allow a prover to prove knowledge of witnesses for k out of n instances of NP languages. Cramer, Schoenmakers and Damgårdï¾¿ provided an efficient construction of a 3-round public-coin witness-indistinguishable k,ï¾¿n-proof of partial knowledge for any NP language, by cleverly combining n executions of $\\...More
PPT (Upload PPT)