Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COMBINER:
Reports tagged with Combiner:
TR25-023 | 24th February 2025
Benny Applebaum, Eliran Kachlon

How to Share an NP Statement or Combiners for Zero-Knowledge Proofs

Revisions: 1

In Crypto'19, Goyal, Jain, and Sahai (GJS) introduced the elegant notion of *secret-sharing of an NP statement* (NPSS). Roughly speaking, a t-out-of-n secret sharing of an NP statement is a reduction that maps an instance-witness pair to n instance-witness pairs such that any subset of (t-1) reveals no information about ... more >>>




ISSN 1433-8092 | Imprint