Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Torben P. Pedersen
- pp 129-140
Reads0
Chats0
TLDR
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons.Abstract:
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these persons can later find the secret (1 ? k ? n), whereas fewer than k persons get no (Shannon) information about the secret. The information rate of the scheme is 1/2 and the distribution as well as the verification requires approximately 2k modular multiplications pr. bit of the secret. It is also shown how a number of persons can choose a secret "in the well" and distribute it veritably among themselves.read more
Citations
More filters
Book ChapterDOI
New Results for the Practical Use of Range Proofs
TL;DR: A variant of the signature-based method which allows the prover to avoid pairing computations and several improvements to the solution based on the multi-base decomposition of the secret are introduced.
Journal ArticleDOI
PUF‐based solutions for secure communications in Advanced Metering Infrastructure (AMI)
TL;DR: In this paper, the authors proposed an authenticated key exchange protocol and an authenticated message broadcasting protocol for Advanced Metering Infrastructure (AMI) systems, based on two well-known protocols, Okamoto and Schnorr, and inherit their security features.
Proceedings ArticleDOI
Lynx: Authenticated anonymous real-time reporting of electric vehicle information
TL;DR: Lynx allows an EV to send anonymous reports using pseudonyms that are unlinkable to its true identity, and the utility can verify that the reports come from some authentic EV without knowing the exact identity of the EV that sends the report.
Posted Content
Practical Verifiable Encryption and Decryption of Discrete Logarithms.
Jan Camenisch,Victor Shoup +1 more
TL;DR: The first verifiable encryption scheme that provides chosen ciphertext security and avoids inecient cut-and-choose proofs was proposed in this paper, based on Paillier's decision composite residuosity assumption.
Journal Article
Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings.
TL;DR: A distributive publicly veriflable secret sharing (DPVSS) is proposed, which also reduces the overhead of communication and is more secure and efiective than others, and it can be more applicable in special situation.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
Proceedings Article
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
TL;DR: The above bounds on t , where t is the number of players in actors, are tight!
Proceedings ArticleDOI
Completeness theorems for non-cryptographic fault-tolerant distributed computation
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.
Proceedings ArticleDOI
Multiparty unconditionally secure protocols
TL;DR: It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.