The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
TASTY: tool for automating secure two-party computations
Open accessAbstract
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the outcome. Existing cryptographic compilers can automatically generate secure computation protocols from high-level specifications, but are often limited in their use and efficiency of generated protocols as they are based on either garbled circuits or (additively) homomorphic encryption only.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
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
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
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
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
(2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.9 · Cited by 1,518
Introduction to algorithms: 4. Turtle graphics
Shyamasundar, R. K. (1996) · Resonance · doi:10.1007/bf02837777 · Cited by 1,467
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Smart, N. P., & Vercauteren, F. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_25 · Cited by 808
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
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
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
Self-citationSharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
A Proof of Security of Yao’s Protocol for Two-Party Computation
Lindell, Y., & Pinkas, B. (2009) · Journal of Cryptology · doi:10.1007/s00145-008-9036-8 · Cited by 651
Efficient oblivious transfer protocols
Naor, M., & Benny Pinkas, B. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365502 · Cited by 614
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
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
FairplayMP: 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
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
Self-citationImproved 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
Self-citationAsynchronous Multiparty Computation: Theory and Implementation
Damgård, I., Geisler, M., Krøigaard, M., & Nielsen, J. B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_10 · Cited by 251
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
Efficient and Secure Comparison for On-Line Auctions
Damgård, I., Geisler, M., & Krøigaard, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73458-1_30 · Cited by 199
Universal circuits (Preliminary Report)
Valiant, L. G. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803649 · Cited by 170
A Simple BGN-Type Cryptosystem from LWE
Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_26 · Cited by 166
Privacy-preserving remote diagnostics
Brickell, J., Porter, D. E., Shmatikov, V., & Witchel, E. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315307 · Cited by 158
Sadeghi, A., Schneider, T. H., & Winandy, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13869-0_30 · Cited by 157
Self-citationSecure Evaluation of Private Linear Branching Programs with Medical Applications
Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04444-1_26 · Cited by 144
Self-citationImplementing 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
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Kolesnikov, V., & Schneider, T. H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85230-8_7 · Cited by 112
Self-citationSecure 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
A domain-specific programming language for secure multiparty computation
Nielsen, J. D., & Schwartzbach, M. I. (2007) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/1255329.1255333 · Cited by 61
Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00730-9_21 · Cited by 51
Self-citation
Cited by
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
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
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F. (2018) · Proceedings of the 2018 on Asia Conference on Computer and Communications Security · doi:10.1145/3196494.3196522 · Cited by 410
Self-citationA New Approach to Practical Active-Secure Two-Party Computation
Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_40 · Cited by 379
Metadata
- Authors
- Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I.
- Venue
- Proceedings of the 17th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2010-10-04
- Pages
- 451-462
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2001084165
- Cited by
- 356
- References
- 44
- FWCI
- 29.37
- Type
- conference paper
- 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.