T. P. Pedersen. Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Simple Publicly Verifiable Secret Sharing Scheme and its.. - Schoenmakers (1999) (17 citations) (Correct)
....therefore require that the participants not only release their shares but also that they provide a proof of correctness for each share released (see Section 2) For PVSS schemes it is natural to accept that the secret is computationally hidden. An information theoretic hiding VSS scheme such as [Ped92a] requires the availability of private channels from the dealer to each of the participants individually. However, communication over the private channels is clearly not publicly verifiable. Given that a PVSS scheme is computationally hiding, the question is what the exact number theoretic ....
T. P. Pedersen. Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March 1992.
A Secure and Optimally Efficient Multi-Authority Election .. - Cramer, Gennaro.. (1997) (24 citations) (Correct)
....generation protocol to generate the private key jointly by the receivers, and (ii) a decryption protocol to jointly decrypt a ciphertext without explicitly reconstructing the private key. For the ElGamal system described above, solutions for both protocols have been described by Pedersen [Ped91, Ped92] also taking robustness into account. Key generation As part of the set up procedure of the election scheme, the authorities will execute a key generation protocol due to Pedersen [Ped91] The result of the key generation protocol is that each authority A j will possess a share s j 2 ZZ q of a ....
T. P. Pedersen. Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March 1992.
A Secure and Optimally Efficient Multi-Authority Election .. - Cramer, Gennaro.. (1997) (24 citations) (Correct)
....protocol to generate the private key jointly by the receivers, and (ii) a decryption protocol to jointly decrypt a ciphertext without explicitly reconstructing the private key. For the ElGamal system described above, solutions for both protocols have been described by Pedersen [Ped91, Ped92] also taking robustness into account. Key generation As part of the set up procedure of the election scheme, the authorities will execute a key generation protocol due to Pedersen [Ped91] The result of the key generation protocol is that each authority A j will possess a share s j 2 ZZ q of a ....
T. P. Pedersen. Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March 1992.
An Efficient Off-line Electronic Cash System Based On The.. - Brands (1993) (50 citations) (Correct)
No context found.
Pedersen, T., "Distributed provers and verifiable secret sharing based on the discrete logarithm problem", Ph. D. Thesis, DAIMI PB - 388 (March 1992), Computer Science Dept. Aarhus University, Denmark. 74
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC