|
|
| Line 1: |
Line 1: |
| In cryptography, a [[cryptosystem]] is called a "threshold cryptosystem", if in order to decrypt an encrypted message a number of parties exceeding a threshold is required to cooperate in the decryption [[Cryptographic protocol|protocol]]. The message is encrypted using a [[public key]] and the corresponding private key is [[secret sharing|shared]] among the participating parties. Let <math>n</math> be the number of parties. Such a system is called ''(t,n)''-threshold, if at least ''t'' of these parties can efficiently decrypt the ciphertext, while less than ''t'' have no useful information. Similarly it is possible to define ''(t,n)''-threshold [[Digital signature|signature scheme]], where at least ''t'' parties are required for creating a signature.
| | The writer's name is Christy Brookins. Playing badminton is a factor that he is completely addicted to. Distributing manufacturing is where my main income comes from and it's something I really enjoy. Her family life in Alaska but her spouse desires them to move.<br><br>Here is my site :: [http://brazil.amor-amore.com/irboothe best psychics] |
| | |
| Threshold versions of encryption schemes can be built for many public encryption schemes. The natural goal of such schemes is to be as secure as the original scheme. Such threshold versions have been defined for:
| |
| * [[RSA (algorithm)|RSA]]
| |
| * [[Pallier cryptosystem]]
| |
| * [[Damgård–Jurik cryptosystem]]<ref>Ivan Damgård, Mads Jurik: [http://www.brics.dk/RS/03/16/index.html A Length-Flexible Threshold Cryptosystem with Applications]. ACISP 2003: 350-364</ref><ref>Ivan Damgård, Mads Jurik: [http://www.brics.dk/RS/00/45/ A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System]. Public Key Cryptography 2001: 119-136</ref>
| |
| * [[ElGamal]]
| |
| | |
| == Application ==
| |
| | |
| The most common application is in the storage of secrets in multiple locations to prevent the capture of the [[ciphertext]] and the subsequent performance of [[cryptanalysis]] on that cyphertext. Most often the secrets that are "split" are the secret key material of a [[public key cryptography]] key pair or the ciphertext of stored password hashes.
| |
| | |
| Historically, only organizations with very valuable secrets, such as [[certificate authority|certificate authorities]], militaries, and governments, would make use of the technology. However, in October 2012 after a number of large public website password ciphertext compromises, [[RSA_(security_firm)|RSA Security]] announced that it would be releasing software that makes the technology available to the general public. <ref>{{cite news |url=http://www.technologyreview.com/news/429498/to-keep-passwords-safe-from-hackers-just-break/ |title=To Keep Passwords Safe from Hackers, Just Break Them into Bits | author=Tom Simonite |date=October 9, 2012 |work=Technology Review |accessdate=October 9, 2012}}</ref>
| |
| | |
| == See also ==
| |
| * [[Secret sharing]]
| |
| * [[Threshold (disambiguation)]]
| |
| * [[Distributed key generation]]
| |
| * [[Broadcast encryption]]
| |
| | |
| ==References==
| |
| {{Reflist}}
| |
| | |
| {{Cryptography navbox|public-key}}
| |
| | |
| [[Category:Public-key cryptography]]
| |
| | |
| | |
| {{crypto-stub}}
| |
The writer's name is Christy Brookins. Playing badminton is a factor that he is completely addicted to. Distributing manufacturing is where my main income comes from and it's something I really enjoy. Her family life in Alaska but her spouse desires them to move.
Here is my site :: best psychics