The DOI matches its OpenAlex record; 33 of the 33 references it cites were found in a registry or an index.
Faster Secure Two-Party Computation Using Garbled Circuits
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1994) · Cited by 21,711
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
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
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
How to Exchange Secrets with Oblivious TransferPreprint
Rabin, M. O. (1981) · IACR Cryptology ePrint Archive · Cited by 870
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
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 Face Recognition
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., & Toft, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03168-7_14 · Cited by 583
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Lindell, Y., & Pinkas, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_4 · Cited by 427
Efficient Privacy-Preserving Face Recognition
Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14423-3_16 · Cited by 363
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
An ASIC Implementation of the AES SBoxes
Wolkerstorfer, J., Oswald, E., & Lamberger, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-45760-7_6 · Cited by 298
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Kolesnikov, V., Sadeghi, A.-R., & Schneider, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10433-6_1 · Cited by 263
SCiFI - A System for Secure Face Identification
Osadchy, M., Pinkas, B., Jarrous, A., & Moskovich, B. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.39 · Cited by 232
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Aumann, Y., & Lindell, Y. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9040-7 · Cited by 205
Towards Practical Privacy for Genomic Computation
Jha, S., Kruger, L., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.34 · Cited by 201
Efficient Privacy-Preserving Biometric Identification
Huang, Y., Malka, L., Evans, D., & Katz, J. I. (2011) · Cited by 181
Self-citationComputationally Secure Oblivious Transfer
Naor, M., & Pinkas, B. (2005) · Journal of Cryptology · doi:10.1007/s00145-004-0102-6 · Cited by 180
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lindell, Y., & Pinkas, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_20 · Cited by 175
Two-Output Secure Computation with Malicious Adversaries
shelat, A., & Shen, C.-H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_22 · Cited by 159
LEGO for Two-Party Secure Computation
Nielsen, J. B., & Orlandi, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_22 · Cited by 158
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Lindell, Y., Benny Pinkas, B., & Smart, N. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85855-3_2 · Cited by 142
OT-Combiners via Secure Computation
Harnik, D., Ishai, Y., Kushilevitz, E., & Nielsen, J. B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78524-8_22 · Cited by 96
Secure Hamming Distance Based Computation and Its Applications
Jarrous, A., & Benny Pinkas, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_7 · Cited by 68
Szajda, D., Pohl, M., Owen, J., & Lawson, B. G. (2006) · Cited by 41
Mott, R. (2005) · Encyclopedia of Life Sciences · doi:10.1038/npg.els.0005263 · Cited by 18
Cited by
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
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
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
VC3: Trustworthy Data Analytics in the Cloud Using SGX
Schuster, F., Costa, M., Fournet, C., Gkantsidis, C., Peinado, M., Mainar-Ruiz, G., & Russinovich, M. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.10 · Cited by 595
Foundations of garbled circuits
Bellare, M., Hoang, V. T., & Rogaway, P. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382279 · Cited by 541
Metadata
- Authors
- Huang, Y., Evans, D., Katz, J. I., & Malka, L.
- Published
- 2011-01-01
- Pages
- 35-35
- OpenAlex
- W2119948977
- Cited by
- 532
- References
- 33
- FWCI
- 50.56
- Type
- journal article
- Language
- en
- Open access
- green
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.