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
Posted Content
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication.
TL;DR: A credential system that lets a user anonymously authenticate at most $n$ times in a single time period, based on e-cash, which can use existing techniques to identify a cheating user, trace all of her e-tokens, and revoke her dispensers.
Proceedings ArticleDOI
PERM: practical reputation-based blacklisting without TTPS
Man Ho Au,Apu Kapadia +1 more
TL;DR: PERM as mentioned in this paper is a revocation-window-based scheme, which makes computation independent of the size of the reputation list and makes reputation-based blacklisting practical for large-scale deployments.
Patent
Time delayed key escrow
Shafi Goldwasser,Mihir Bellare +1 more
TL;DR: In this paper, the authors proposed a key escrow scheme in which the government gets some information related to the secret keys of individuals but not the secret key themselves, and the information given to the government enables it to decrypt with a predetermined level of computational difficulty less than that for adversaries at large.
Posted Content
On definitions of selective opening security.
TL;DR: In this article, the authors show that simulation-based and indistinguishability-based selective opening security do not imply each other, and construct two public-key encryption schemes that are secure under selective openings.
BookDOI
Information Security and Cryptology - ICISC’99
TL;DR: Results on pseudorandomness of some block cipher constructions and on message authentication code constructions are covered and handy tools based on Decorrelation Theory are provided for dealing with them and how to make their proof easier is shown.
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.