The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Threshold cryptography
Abstract
In the traditional scenario in cryptography there is one sender, one receiver and an active or passive eavesdropper who is an opponent. Large bank transactions require two people to sign, implying two senders. So the power to generate a valid transaction is shared. Threshold cryptography allows one to share the power of a cryptosystem. Threshold cryptosystems are distinct from threshold schemes in which the power to regenerate a secret key is shared. A normal threshold scheme is not directly suited for threshold signatures. Using a threshold scheme directly would require the shareholders to send their shares to a trusted person who would apply the cryptosystem for them. But the use of such a trusted person violates the main point of threshold cryptography. We motivate the need for treshold cryptosystems, overview the research in the field, and give some simple examples. We will conclude by giving a list of open problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
Advances in Cryptology — CRYPTO ’91: Proceedings
(1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1 · Cited by 687
(1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4 · Cited by 661
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
Horadam, K. (2003) · Lecture notes in computer science · doi:10.1007/b93924 · Cited by 524
Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
Zero knowledge proofs of identity
Fiege, U., Fiat, A., & Shamir, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28419 · Cited by 407
How to share a function securely
De Santis, A., Desmedt, Y., Frankel, Y., & Yung, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195405 · Cited by 328
Self-citationAdvances in Cryptology — AUSCRYPT '92
(1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1 · Cited by 195
A digital multisignature scheme using bijective public-key cryptosystems
Okamoto, T. (1988) · ACM Transactions on Computer Systems · doi:10.1145/48012.48246 · Cited by 145
Micali, S. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_9 · Cited by 142
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
Desmedt, Y., Frankel, Y., & Yung, M. M. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263476 · Cited by 125
Self-citationA digital multisignature scheme based on the Fiat-Shamir scheme
Ohta, K., & Okamoto, T. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_11 · Cited by 104
Secure implementation of identification systems
Samy Bengio, A., Brassard, G., Desmedt, Y., Goutier, C., & Quisquater, J.-J. (1991) · Journal of Cryptology · doi:10.1007/bf00196726 · Cited by 103
Self-citationSequences II: Methods in Communication, Security, and Computer Science
Capocelli, R. M., Santis, A. D., & Vaccaro, U. (2011) · Springer eBooks · Cited by 71
The generation of random numbers that are probably prime
Beauchemin, P., Gilles Brassard, A., Crépeau, C., Goutier, C., & Pomerance, C. B. (1988) · Journal of Cryptology · doi:10.1007/bf00206325 · Cited by 36
How to sign given any trapdoor function
Mihir Bellare, Y., & Micali, S. M. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62216 · Cited by 28
Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups
Frankel, Y., & Desmedt, Y. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_2 · Cited by 16
Self-citation
Cited by
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Towards secure and dependable software-defined networks
Kreutz, D., Ramos, F. M. V., & Verissimo, P. (2013) · Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking · doi:10.1145/2491185.2491199 · Cited by 697
Robust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_31 · Cited by 427
Metadata
- Authors
- Desmedt, Y. G.
- Venue
- European Transactions on Telecommunications
- Publisher
- Wiley
- Published
- 1994-07
- Volume
- 5
- Issue
- 4
- Pages
- 449-458
- ISSN
- 1124-318X (ISSN-L)
- 1541-8251
- OpenAlex
- W4245079094
- Cited by
- 292
- References
- 30
- FWCI
- 8.66
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.