The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Mix and Match: Secure Function Evaluation via Ciphertexts
Open accessOverview
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
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
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
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
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
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
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 practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
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
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
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
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
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
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
On the security of ElGamal based encryption
Tsiounis, Y., & Yung, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054019 · Cited by 380
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
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
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
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_22 · Cited by 220
Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result
Chaum, D., Damgård, I. B., & van de Graaf, J. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_7 · Cited by 216
Adaptive Security for Threshold Cryptosystems
Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_7 · Cited by 190
Jakobsson, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054145 · Cited by 181
Self-citationAn Auction Protocol Which Hides Bids of Losers
Sako, K. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_28 · Cited by 149
Efficient Secure Multi-party Computation
Hirt, M., Maurer, U. M., & Przydatek, B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_12 · Cited by 128
Jakobsson, M. (1999) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/301308.301333 · Cited by 128
Self-citationElectronic auctions with private bids
Harkavy, M. D., Tygar, J. D., & Kikuchi, H. (1998) · Cited by 123
Joint Encryption and Message-Efficient Secure Computation
Franklin, M., & Haber, S. (1996) · Journal of Cryptology · doi:10.1007/bf00189261 · Cited by 83
Millimix: Mixing in Small Batches
Jakobsson, M., & Juels, A. (1999) · Cited by 76
Self-citationMultiparty Computation from Threshold Homomorphic Encryption
Cramer, R., Damgård, I., & Nielsen, J. B. (2000) · BRICS Report Series · doi:10.7146/brics.v7i14.20141 · Cited by 46
Private Selective Payment Protocols
Crescenzo, G. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45472-1_6 · Cited by 40
Cited by
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
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
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · Proceedings of the 2005 ACM workshop on Privacy in the electronic society · doi:10.1145/1102199.1102213 · Cited by 414
Self-citationCivitas: Toward a Secure Voting System
Clarkson, M. R., Chong, S., & Myers, A. C. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.32 · Cited by 397
Metadata
- Authors
- Jakobsson, M., & Juels, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 162-177
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1492124753
- Cited by
- 276
- References
- 39
- FWCI
- 5.36
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.