The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Open accessAbstract
Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that:
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
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
Self-citationReaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
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
Mann, H. B. (1961) · Technometrics · doi:10.1080/00401706.1961.10489978 · Cited by 1,069
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
Self-citationPolynomial algorithms for multiple processor agreement
Dolev, D., & Strong, H. R. (1982) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800070.802215 · Cited by 166
Cited by
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Decentralizing Privacy: Using Blockchain to Protect Personal Data
Zyskind, G., Nathan, O., & Pentland, A. '. (2015) · 2015 IEEE Security and Privacy Workshops · doi:10.1109/spw.2015.27 · Cited by 2,617
“, using Shamir’s Secret Sharing [23]), rather than encrypting them, we could then use secure Multiparty Computation (MPC) to securely evaluate any function [3].”
MethodNon-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
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
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
Self-citationPrivacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Private Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
Self-citationSearchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
Efficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
A practical secret voting scheme for large scale elections
Fujioka, A., Okamoto, T., & Ohta, K. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57220-1_66 · Cited by 832
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 723
The round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
Secure Two-Party Computation Is Practical
Pinkas, B., Schneider, T., Smart, N. P., & Williams, S. C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_15 · Cited by 711
Privacy Preserving Data Mining
Lindell, & Pinkas (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0019-2 · Cited by 668
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Self-citationChecking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
Multiparty Computation from Threshold Homomorphic Encryption
Cramer, R., Damgård, I., & Nielsen, J. B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_18 · Cited by 578
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 554
Adaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
Secure Multiparty Computation Goes Live
Bogetoft, P., Christensen, D. L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., et al. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03549-4_20 · Cited by 539
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Cramer, R., Damgård, I., & Maurer, U. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_22 · Cited by 533
Publicly Verifiable Secret Sharing
Stadler, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_17 · Cited by 531
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Self-citationFairplayMP: a system for secure multi-party computation
Ben-David, A., Nisan, N., & Pinkas, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455804 · Cited by 475
How to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
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
Founding Cryptography on Oblivious Transfer – Efficiently
Ishai, Y., Prabhakaran, M., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_32 · Cited by 460
Protecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276723 · Cited by 445
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443
Collaborative filtering with privacy
Canny, J. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004361 · Cited by 442
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.30 · Cited by 439
Receipt-free secret-ballot elections (extended abstract)
Benaloh, J., & Tuinstra, D. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195407 · Cited by 432
Cryptographic techniques for privacy-preserving data mining
Pinkas, B. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772865 · Cited by 430
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · 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
Dwork, C., Naor, M., & Sahai, A. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276853 · Cited by 425
SecureNN: 3-Party Secure Computation for Neural Network Training
Wagh, S., Gupta, D., & Chandran, N. (2019) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2019-0035 · Cited by 413
Zero-knowledge from secure multiparty computation
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250794 · Cited by 412
Perfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 412
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Araki, T., Furukawa, J., Lindell, Y., Nof, A., & Ohara, K. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978331 · Cited by 405
An explication of secret sharing schemes
Stinson, D. R. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00125203 · Cited by 396
Thapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_7 · Cited by 379
Enigma: Decentralized Computation Platform with Guaranteed Privacy
Zyskind, G., & Pentland, A. (2018) · New Solutions for Cybersecurity · doi:10.7551/mitpress/11636.003.0018 · Cited by 368
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Function Secret Sharing: Improvements and Extensions
Boyle, E., Gilboa, N., & Ishai, Y. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978429 · Cited by 358
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Semi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_11 · Cited by 354
Fair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_6 · Cited by 353
Abraham, I., Dolev, D., Gonen, R., & Halpern, J. (2006) · Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing · doi:10.1145/1146381.1146393 · Cited by 343
How to Use Bitcoin to Design Fair Protocols
Bentov, I., & Kumaresan, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44381-1_24 · Cited by 339
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
Nielsen, J. B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_8 · Cited by 324
Lindell, Y. (2021) · Communications of the ACM · doi:10.1145/3387108 · Cited by 320
Rational secret sharing and multiparty computation: extended abstract
Halpern, J., & Teague, V. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007447 · Cited by 319
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3054610 · Cited by 318
Fast asynchronous Byzantine agreement with optimal resilience
Canetti, R., & Rabin, T. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167105 · Cited by 309
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488623 · Cited by 304
Non-Interactive Oblivious Transfer and Applications
Bellare, M., & Micali, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_48 · Cited by 297
Functional Encryption with Bounded Collusions via Multi-party Computation
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_11 · Cited by 294
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Agrawal, S., Libert, B., & Stehlé, D. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53015-3_12 · Cited by 293
Differentially Private Distributed Constrained Optimization
Han, S., Topcu, U., & Pappas, G. J. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2541298 · Cited by 292
(2010) · Cited by 291
Aumann, R. J., & Hart, S. (2003) · Econometrica · doi:10.1111/1468-0262.00465 · Cited by 282
Non-interactive cryptocomputing for NC/sup 1/
Sander, T., Young, A., & Yung, M. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814630 · Cited by 279
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
Foundations of Secure Interactive Computing
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_31 · Cited by 277
Mix and Match: Secure Function Evaluation via Ciphertexts
Jakobsson, M., & Juels, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_13 · Cited by 276
Scalable and Unconditionally Secure Multiparty Computation
Damgård, I., & Nielsen, J. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_32 · Cited by 270
Communication complexity of secure computation (extended abstract)
Franklin, M., & Yung, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129780 · Cited by 268
Efficient private bidding and auctions with an oblivious third party
Cachin, C. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319726 · Cited by 267
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Bar-Ilan, J., & Beaver, D. (1989) · Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89 · doi:10.1145/72981.72995 · Cited by 266
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
A simplified approach to threshold and proactive RSA
Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055722 · Cited by 262
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 261
Universal Composition with Joint State
Canetti, R., & Rabin, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_16 · Cited by 259
Chen, H., Dai, W., Kim, M., & Song, Y. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363207 · Cited by 256
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
Ishai, Y., & Kushilevitz, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892118 · Cited by 254
Security issues and requirements for Internet-scale publish-subscribe systems
Wang, C., Carzaniga, A., Evans, D., & Wolf, A. L. (2003) · Proceedings of the 35th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2002.994531 · Cited by 176
A Berkeley View of Systems Challenges for AI
Stoica, I., Song, D., Popa, R. A., Patterson, D., Mahoney, M. W., Katz, R., Joseph, A. D., Jordan, M., Hellerstein, J. M., Gonzalez, J. E., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.05855 · Cited by 171
“Another promising approach is using secure multi-party computation (MPC) [13, 45, 70].”
BackgroundDeriving genomic diagnoses without revealing patient genomes
Jagadeesh, K. A., Wu, D. J., Birgmeier, J. A., Boneh, D., & Bejerano, G. (2017) · Science · doi:10.1126/science.aam9710 · Cited by 134
Realizing private and practical pharmacological collaboration
Hie, B., Cho, H., & Berger, B. (2018) · Science · doi:10.1126/science.aat4807 · Cited by 76
Maturity and Performance of Programmable Secure Computation
Archer, D. W., Bogdanov, D., Pinkas, B., & Pullonen, P. (2016) · IEEE Security & Privacy · doi:10.1109/msp.2016.97 · Cited by 31
Certified randomness amplification by dynamically probing remote random quantum states
Liu, M., Niroula, P., DeCross, M., Foreman, C., Kon, W. Y., Primaatmaja, I. W., Allman, M. S., Campora, J. P., Isanaka, A., Singhal, K., et al. (2025) · arXiv · doi:10.48550/arxiv.2511.03686
Metadata
- Authors
- Ben-Or, M., & Wigderson, A.
- Venue
- Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88
- Publisher
- ACM Press
- Published
- 1988
- Pages
- 1-10
- OpenAlex
- W2006453614
- Cited by
- 2,524
- References
- 10
- FWCI
- 12.66
- Type
- conference paper
- Language
- en
- Open access
- gold
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.