Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
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
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
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
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
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
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
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Pinkas, B., & Sella, Y. (2004) · USENIX Security Symposium · Cited by 852
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
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
Self-citationAn 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
Self-citationPriced Oblivious Transfer: How to Sell Digital Goods
Aiello, B., Ishai, Y., & Reingold, O. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_8 · Cited by 400
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
Foundations of Secure Interactive Computing
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_31 · Cited by 277
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
Micali, S. M., & Rogaway, P. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_32 · Cited by 163
Smooth Projective Hashing and Two-Message Oblivious Transfer
Kalai, Y. T. (2005) · Lecture notes in computer science · doi:10.1007/11426639_5 · Cited by 139
Secure Multi-Party Computation without Agreement
Goldwasser, S., & Lindell, Y. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0319-z · Cited by 109
Self-citationSecure Computation without Agreement: Extended Abstract
Goldwasser, S., & Lindell, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36108-1_2 · Cited by 105
Self-citationBlack-box constructions for secure computation
Ishai, Y., Kushilevitz, E., Lindell, Y., & Petrank, E. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132531 · Cited by 79
Self-citationEfficient Fully-Simulatable Oblivious Transfer
Lindell, A. Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-79263-5_4 · Cited by 65
Session-Key Generation Using Human Passwords Only
Goldreich, O., & Lindell, Y. (2006) · Journal of Cryptology · doi:10.1007/s00145-006-0233-z · Cited by 59
Self-citationvon Ahn, L., Hopper, N., & Langford, J. C. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060668 · Cited by 46
Cited by
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
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
Self-citationFoundations 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
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40203-6_1 · Cited by 458
Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_17 · Cited by 290
Metadata
- Authors
- Aumann, Y., & Lindell, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-05-16
- Pages
- 137-156
- OpenAlex
- W1515945955
- Cited by
- 211
- References
- 25
- FWCI
- 9.11
- 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.