What is recorded here?
Two-generator perfectly hiding commitments combine with polynomial shares so recipients verify consistency non-interactively; secret privacy is information-theoretic while share consistency relies on the dealer not knowing the generator discrete-log relation.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The construction combines threshold sharing with commitments in a prime-order group. Perfect hiding uses uniformly random blinding; computational binding assumes that the discrete-log relationship between the two generators is unknown to the committing party. Share verification and reconstruction use the stated participant indices, threshold and broadcast/private-channel model. Information-theoretic privacy does not mean unconditional resistance to malicious inconsistent openings. The work was presented at CRYPTO 1991 and printed in 1992. WRS has not independently reconstructed the full security proof or certified the exact formula transcription.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Torben Pryds Pedersen
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Pedersen: verify shared secret pieces without exposing the secret
Two-generator perfectly hiding commitments combine with polynomial shares so recipients verify consistency non-interactively; secret privacy is information-theoretic while share consistency relies on the dealer not knowing the generator discrete-log relation.
Scientific scope
The construction combines threshold sharing with commitments in a prime-order group. Perfect hiding uses uniformly random blinding; computational binding assumes that the discrete-log relationship between the two generators is unknown to the committing party. Share verification and reconstruction use the stated participant indices, threshold and broadcast/private-channel model. Information-theoretic privacy does not mean unconditional resistance to malicious inconsistent openings. The work was presented at CRYPTO 1991 and printed in 1992. WRS has not independently reconstructed the full security proof or certified the exact formula transcription.
People and systems
Torben Pryds Pedersen