The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Universally Composable Commitments
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
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
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
Self-citationGoldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
IEEE Symposium on Security and Privacy
(2023) · IT Professional · doi:10.1109/mitp.2023.3246667 · Cited by 1,167
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Bit commitment using pseudorandomness
Naor, M. (1991) · Journal of Cryptology · doi:10.1007/bf00196774 · Cited by 807
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Witness indistinguishable and witness hiding protocols
Feige, U., & Shamir, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100272 · Cited by 523
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Bellare, M., Boldyreva, A., & Micali, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_18 · Cited by 519
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
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
A model for asynchronous reactive systems and its application to secure message transmission
Pfitzmann, B., & Waidner, M. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924298 · Cited by 349
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
Damgård, I. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_30 · Cited by 295
Blum, M. (1981) · International Cryptology Conference · Cited by 256
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 228
Non-interactive and non-malleable commitment
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276722 · Cited by 159
Efficient and Non-interactive Non-malleable Commitment
Crescenzo, G. D., Katz, J. I., Ostrovsky, R., & Smith, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_4 · Cited by 121
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
Galil, Z., Haber, S., & Yung, M. M. (1987) · International Cryptology Conference · Cited by 89
Efficient Non-malleable Commitment Schemes
Fischlin, M., & Fischlin, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_26 · Cited by 83
Self-citationOn the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
Damgård, I. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_3 · Cited by 58
Galil, Z., Haber, S., & Yung, M. M. (1988) · Lecture notes in computer science · doi:10.1007/3-540-48184-2_10 · Cited by 52
Adaptive zero knowledge and computational equivocation (extended abstract)
Beaver, D. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.238014 · Cited by 40
A General Framework for Formal Notions of "Secure" Systems
Pfitzmann, B., & Waidner, M. (1994) · Cited by 15
Cited by
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-citationDigital Twin in the IoT Context: A Survey on Technical Features, Scenarios, and Architectural Models
Minerva, R., Lee, G. M., & Crespi, N. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2998530 · Cited by 812
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 Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
BiTR: Built-in Tamper Resilience
Choi, S. G., Kiayias, A., & Malkin, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_40 · Cited by 590
Metadata
- Authors
- Canetti, R., & Fischlin, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 19-40
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1867273832
- Cited by
- 621
- References
- 34
- FWCI
- 10.28
- 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.