A public-key threshold cryptosystem based on residue rings
| Autor: | Eduardo Dueñez, José Iovino, Stephanie Deacon |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Discrete mathematics
Algebra and Number Theory Mathematics::Operator Algebras business.industry Applied Mathematics Public-key cryptography Mathematics::K-Theory and Homology ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Physics::Space Physics Computer Science::Networking and Internet Architecture business Threshold cryptosystem Analysis Computer Science::Cryptography and Security Mathematics |
| Zdroj: | Journal of Discrete Mathematical Sciences and Cryptography. 10:559-571 |
| ISSN: | 2169-0065 0972-0529 |
| DOI: | 10.1080/09720529.2007.10698139 |
| Popis: | We present a generalization of Pedersen’s public-key threshold cryptosystem. Pedersen’s protocol relies on the field properties of ℤ p . We generalize the protocol so that the calculations can be performed in residue rings that are not necessarily fields. The protocol presented here is polynomial-time equivalent to Pedersen’s. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|