The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A practical scheme for non-interactive verifiable secret sharing
Abstract
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing (VSS) is a way of bequeathing information to a set of processors such that a quorum of processors is needed to access the information. VSS is a fundamental tool of cryptography and distributed computing. Seemingly difficult problems such as secret bidding, fair voting, leader election, and flipping a fair coin have simple one-round reductions to VSS. There is a constant-round reduction from Byzantine Agreement to non-interactive VSS. Non-interactive VSS provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good. VSS is constantly repeated in the simulation of fault-free protocols by faulty systems. As verifiable secret sharing is a bottleneck for so many results, it is essential to find efficient solutions.
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
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
National Cancer Institute (2020) · Definitions · doi:10.32388/bz83sn · Cited by 2,981
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
Verifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Cited by
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
RapidChain: Scaling Blockchain via Full Sharding
Zamani, M., Movahedi, M., & Raykova, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243853 · Cited by 1,121
Multi-authority Attribute Based Encryption
Chase, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_28 · Cited by 1,112
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Lai, H., Zhang, J., Luo, M.-X., Pan, L., Pieprzyk, J., Xiao, F., & Orgun, M. A. (2016) · Scientific Reports · doi:10.1038/srep31350 · Cited by 808
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_27 · Cited by 738
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
Generalized Secret Sharing and Monotone Functions
Benaloh, J., & Leichter, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_3 · Cited by 677
Constant-Size Commitments to Polynomials and Their Applications
Kate, A., Zaverucha, G. M., & Goldberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_11 · Cited by 624
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_21 · Cited by 545
Publicly Verifiable Secret Sharing
Stadler, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_17 · Cited by 531
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Hirt, M., & Sako, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_38 · Cited by 483
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Schoenmakers, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_10 · Cited by 448
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (2007) · Journal of Cryptology · doi:10.1007/s00145-006-0347-3 · Cited by 428
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
How to share a secret with cheaters
Tompa, M., & Woll, H. (1989) · Journal of Cryptology · doi:10.1007/bf02252871 · Cited by 388
Towards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
Byzantine-Resilient Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3041404 · Cited by 313
How to (Really) Share a Secret
Simmons, G. J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_30 · Cited by 300
Efficient Trace and Revoke Schemes
Naor, M., & Pinkas, B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_1 · Cited by 298
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
Scalable Bias-Resistant Distributed Randomness
Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., & Ford, B. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.45 · Cited by 290
COCA: A secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571638 · Cited by 278
The design and implementation of a secure auction service
Franklin, M. K., & Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.502223 · Cited by 274
Wang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
Survey: sharding in blockchains
Yu, G., Wang, X., Yu, K., Ni, W., Zhang, J. A., & Liu, R. P. (2020) · IEEE Access · doi:10.1109/access.2020.2965147 · Cited by 267
A simplified approach to threshold and proactive RSA
Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055722 · Cited by 262
Efficient and Generalized Group Signatures
Camenisch, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_32 · Cited by 257
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62225 · Cited by 255
Self-citationProactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266442 · Cited by 253
Short Threshold Dynamic Group Signatures
Camenisch, J., Drijvers, M., Lehmann, A., Neven, G., & Towa, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-57990-6_20 · Cited by 59
Metadata
- Authors
- Feldman, P.
- Venue
- 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
- Publisher
- IEEE
- Published
- 1987-10
- Pages
- 427-438
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2168970529
- Cited by
- 1,125
- References
- 12
- FWCI
- 2.28
- Type
- conference paper
- 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.