The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Universally Composable Security with Global Setup
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
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
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
Self-citationThe knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,643
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Self-citationGoldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
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
Designated Verifier Proofs and Their Applications
Jakobsson, M., Sako, K., & Impagliazzo, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_13 · Cited by 817
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
Self-citationA Signature Scheme with Efficient Protocols
Camenisch, J., & Lysyanskaya, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36413-7_20 · Cited by 662
Universally Composable Commitments
Canetti, R., & Fischlin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_2 · Cited by 621
Self-citationFair 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
Bellare, M., & Palacio, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_11 · Cited by 312
Zero Knowledge Proofs of Knowledge in Two Rounds
Feige, U., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_46 · Cited by 280
Composition and integrity preservation of secure reactive systems
Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277
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
Self-citationSecure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 228
Bounded-concurrent secure multi-party computation with a dishonest majority
Pass, R. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007393 · Cited by 182
Self-citationOn the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
Canetti, R., Kushilevitz, E., & Lindell, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_5 · Cited by 165
Self-citationUniversally composable signature, certification, and authentication
Canetti, R. (2004) · doi:10.1109/csfw.2004.24 · Cited by 165
Self-citationNew notions of security: achieving universal composability without trusted setup
Prabhakaran, M., & Sahai, A. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007394 · Cited by 147
General Composition and Universal Composability in Secure Multiparty Computation
Lindell, Y. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9021-2 · Cited by 142
Damgård, I., & Nielsen, J. B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_37 · Cited by 135
Barak, B., & Sahai, A. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.43 · Cited by 110
Perfect NIZK with Adaptive Soundness
Abe, M., & Fehr, S. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_7 · Cited by 109
Secure Computation Without Authentication
Barak, B., Canetti, R., Lindell, Y., Pass, R., & Rabin, T. (2005) · Lecture notes in computer science · doi:10.1007/11535218_22 · Cited by 107
Self-citationOn Simulation-Sound Trapdoor Commitments
MACKENZIE, P. D., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_23 · Cited by 106
Universally composable signature, certification, and authentication
Canetti, R. (2004) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2004.1310743 · Cited by 89
Self-citationParallel Reducibility for Information-Theoretically Secure Computation
Dodis, Y., & Micali, S. M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_5 · Cited by 38
Self-citation
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
“[36] also propose a blockchain model in the (Generalized) Universal Composability framework [23] and use it to derive results that are similar to what we describe in the online version [37], i.”
ResultSecure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Town Crier: An Authenticated Data Feed for Smart Contracts
Zhang, F., Cecchetti, E., Croman, K., Juels, A., & Shi, E. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978326 · Cited by 580
Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab
Delmolino, K., Arnett, M., Kosba, A., Miller, A., & Shi, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_6 · Cited by 505
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Metadata
- Authors
- Canetti, R., Dodis, Y., Pass, R., & Walfish, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-05-16
- Pages
- 61-85
- OpenAlex
- W1562226375
- Cited by
- 331
- References
- 31
- FWCI
- 10.19
- 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.