Universal Re-encryption for Mixnets
The DOI matches its Crossref record; 23 of the 23 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
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 · cited 17×
“One common variety of mixnet known as a re-encryption mixnet relies on a public-key encryption scheme, such as ElGamal [9], that allows for re-encryption of ciphertexts.”
BackgroundInfluentialUntraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
(2005) · Codes · doi:10.1201/9781420035087-10 · Cited by 913
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 790
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5 · Cited by 671
RFID Systems and Security and Privacy Implications
Sarma, S. E., Weis, S. A., & Engels, D. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_33 · Cited by 547
A verifiable secret shuffle and its application to e-voting
Neff, C. A. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502000 · Cited by 513
Key-Privacy in Public-Key Encryption
Bellare, M., Boldyreva, A., Desai, A., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_33 · Cited by 442
On the security of ElGamal based encryption
Tsiounis, Y., & Yung, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054019 · Cited by 380
Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking.
Jakobsson, M., Juels, A., & Rivest, R. L. (2002) · Cited by 371
Self-citationSquealing Euros: Privacy Protection in RFID-Enabled Banknotes
Juels, A., & Pappu, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45126-6_8 · Cited by 347
Self-citationA Proposal for an ISO Standard for Public Key Encryption.
Shoup, V. (2001) · Cited by 271
An Efficient Scheme for Proving a Shuffle
Furukawa, J., & Sako, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_22 · Cited by 199
From a Trickle to a Flood: Active Attacks on Several Mix Types
Serjantov, A., Dingledine, R., & Syverson, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_3 · Cited by 166
Self-citationOn monotone formula closure of SZK
Santis, A. D., Crescenzo, G. D., Persiano, G., & Yung, M. M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365745 · Cited by 136
Millimix: Mixing in Small Batches
Jakobsson, M., & Juels, A. (1999) · Cited by 76
Self-citationOhkubo, M., & Abe, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_14 · Cited by 75
Protocols using Anonymous Connections: Mobile Applications
Reed, M., Syverson, P. F., & Goldschlag, D. M. (1997) · doi:10.21236/ada465486 · Cited by 21
Self-citation
Cited by
RFID security and privacy: a research survey
Juels, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861395 · Cited by 1,911
Self-citationImproved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
The blocker tag: selective blocking of RFID tags for consumer privacy
Juels, A., Rivest, R. L., & Szydlo, M. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948126 · Cited by 807
Self-citationChosen-ciphertext secure proxy re-encryption
Canetti, R., & Hohenberger, S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315269 · Cited by 540
RFID Privacy: An Overview of Problems and Proposed Solutions
Garfinkel, S. L., Juels, A., & Pappu, R. (2005) · IEEE Security and Privacy Magazine · doi:10.1109/msp.2005.78 · Cited by 499
Self-citation
Metadata
- Authors
- Golle, P., Jakobsson, M., Juels, A., & Syverson, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 163-178
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W233279079
- Cited by
- 412
- References
- 23
- FWCI
- 27.32
- 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.