The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Untraceable electronic mail, return addresses, and digital pseudonyms
Open accessAbstract
A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication--in spite of an unsecured underlying telecommunication system.The technique does not require a universally trusted authority.One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceble return address.The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications.Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms.Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters.Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym which appears in a roster of acceptable clients.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
Research works printed but not linked: 2
- Baran , P. On distributed communications: IX security secrecy and tamper-free considerations. Memo RM-3765-PR , Rand Corp. , Santa Monica, CA , Aug. 1964 . Baran, P. On distributed communications: IX security secrecy and tamper-free considerations. Memo RM-3765-PR, Rand Corp., Santa Monica, CA, Aug. 1964.
- Kahn , D. The Code Breakers , The Story of Secret Writing . Macmillan , New York , 1967 . Kahn, D. The Code Breakers, The Story of Secret Writing. Macmillan, New York, 1967.
Cited by
Design Science in Information Systems Research1
Hevner, A. R., March, S. T., Park, J., & Ram, S. (2004) · MIS Quarterly · doi:10.2307/25148625 · Cited by 10,707
Design science in information systems research
(2004) · Journal of the Association for Information Systems · doi:10.5555/2017212.2017217 · Cited by 8,254
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Secure shufflers have been studied in the context of secure multi-party computation [95, 251], often under the heading of mix networks.”
BackgroundCommunication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
“Further, the source of the updates is not needed by the aggregation algorithm, so updates can be transmitted without identifying meta-data over a mix network such as Tor [7] or via a trusted third party.”
BackgroundDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
“This paper shows that, without aa logically centralized authority,,Sybil attacks are always possible except under extreme andd unrealistic assumptions of resource parity andd coordinationn amongg entities.”
BackgroundTor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
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
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Digital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
Location privacy in pervasive computing
Beresford, A. R., & Stajano, F. (2003) · IEEE Pervasive Computing · doi:10.1109/mprv.2003.1186725 · Cited by 1,568
A survey on security and privacy of federated learning
Mothukuri, V., Parizi, R. M., Pouriyeh, S., Huang, Y., Dehghantanha, A., & Srivastava, G. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2020.10.007 · Cited by 1,480
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
A survey of peer-to-peer content distribution technologies
Androutsellis-Theotokis, S., & Spinellis, D. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041681 · Cited by 1,425
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Self-citationAriadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
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
Game theory meets network security and privacy
Manshaei, M. H., Zhu, Q., Alpcan, T., Bacşar, T., & Hubaux, J.-P. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480742 · Cited by 808
A survey on privacy protection in blockchain system
Feng, Q., He, D., Zeadally, S., Khan, M. K., & Kumar, N. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.10.020 · Cited by 804
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Anonymity, Unobservability, and Pseudonymity — A Proposal for Terminology
Pfitzmann, A., & Köhntopp, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_1 · Cited by 763
Díaz, C., Seys, S., Claessens, J., & Preneel, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_5 · Cited by 728
Goldschlag, D., Reed, M., & Syverson, P. (1999) · Communications of the ACM · doi:10.1145/293411.293443 · Cited by 689
An anonymous communication technique using dummies for location-based services
Kido, H., Yanagisawa, Y., & Satoh, T. (2005) · ICPS '05. Proceedings. International Conference on Pervasive Services, 2005. · doi:10.1109/perser.2005.1506394 · Cited by 683
Towards an Information Theoretic Metric for Anonymity
Serjantov, A., & Danezis, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_4 · Cited by 663
Tarzan: a peer-to-peer anonymizing network layer
Freedman, M. J., & Morris, R. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586137 · Cited by 663
(2010) · Cited by 662
Mixminion: design of a type III anonymous remailer protocol
Danezis, G., Dingledine, R., & Mathewson, N. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199323 · Cited by 658
Privacy-Preserving Set Operations
Kissner, L., & Song, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_15 · Cited by 648
Anonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
An architecture for privacy-sensitive ubiquitous computing
Hong, J. I., & Landay, J. A. (2004) · Proceedings of the 2nd international conference on Mobile systems, applications, and services · doi:10.1145/990064.990087 · Cited by 598
Blockchain technology, bitcoin, and Ethereum: A brief overview
Vujicic, D., Jagodic, D., & Randic, S. (2018) · 2018 17th International Symposium INFOTEH-JAHORINA (INFOTEH) · doi:10.1109/infoteh.2018.8345547 · Cited by 589
Privacy in electronic commerce and the economics of immediate gratification
Acquisti, A. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988777 · Cited by 561
Design and implementation of the idemix anonymous credential system
Camenisch, J., & Van Herreweghen, E. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586114 · Cited by 555
Deng, M., Wuyts, K., Scandariato, R., Preneel, B., & Joosen, W. (2011) · Requirements Engineering · doi:10.1007/s00766-010-0115-7 · Cited by 533
Enhancing Source-Location Privacy in Sensor Network Routing
Kamat, P., Zhang, Y., Trappe, W., & Ozturk, C. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.31 · Cited by 530
Low-Cost Traffic Analysis of Tor
Murdoch, S. J., & Danezis, G. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.12 · Cited by 517
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
Goldschlag, D. M., Reed, M. G., & Syverson, P. F. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_37 · Cited by 494
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Hirt, M., & Sako, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_38 · Cited by 483
Mixcoin: Anonymity for Bitcoin with Accountable Mixes
Bonneau, J., Narayanan, A., Miller, A., Clark, J., Kroll, J. A., & Felten, E. W. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_31 · Cited by 441
Pseudonym Schemes in Vehicular Networks: A Survey
Petit, J., Schaub, F., Feiri, M., & Kargl, F. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2345420 · Cited by 434
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Kong, J., & Hong, X. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778449 · Cited by 432
Receipt-free secret-ballot elections (extended abstract)
Benaloh, J., & Tuinstra, D. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195407 · Cited by 432
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 459
“To anonymize email usage, [126] introduced the mixing methods in 1981.”
MethodSecret-ballot receipts: true voter-verifiable elections
Chaum, D. (2004) · IEEE Security & Privacy Magazine · doi:10.1109/msecp.2004.1264852 · Cited by 426
Self-citationHerrmann, D., Wendolsky, R., & Federrath, H. (2009) · Proceedings of the 2009 ACM workshop on Cloud computing security · doi:10.1145/1655008.1655013 · Cited by 424
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
Raymond, J.-F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_2 · Cited by 422
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
Universal Re-encryption for Mixnets
Golle, P., Jakobsson, M., Juels, A., & Syverson, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24660-2_14 · Cited by 412
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27800-9_28 · Cited by 405
CoinShuffle: Practical Decentralized Coin Mixing for Bitcoin
Ruffing, T., Moreno-Sanchez, P., & Kate, A. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11212-1_20 · Cited by 401
Protecting free expression online with Freenet
Clarke, I., Miller, S. G., Hong, T. W., Sandberg, O., & Wiley, B. (2002) · IEEE Internet Computing · doi:10.1109/4236.978368 · Cited by 401
Civitas: 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
Web MIXes: A System for Anonymous and Unobservable Internet Access
Berthold, O., Federrath, H., & Köpsell, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_7 · Cited by 395
AMOEBA: Robust Location Privacy Scheme for VANET
Sampigethaya, K., Li, M., Huang, L., & Poovendran, R. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.071007 · Cited by 391
Source-location privacy in energy-constrained sensor network routing
Ozturk, C., Zhang, Y., & Trappe, W. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029117 · Cited by 390
An inquiry into money laundering tools in the Bitcoin ecosystem
Moser, M., Bohme, R., & Breuker, D. (2013) · 2013 APWG eCrime Researchers Summit · doi:10.1109/ecrs.2013.6805780 · Cited by 386
Statistical identification of encrypted Web browsing traffic
Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., & Qiu, L. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004359 · Cited by 377
Anonysense: privacy-aware people-centric sensing
Cornelius, C., Kapadia, A., Kotz, D., Peebles, D., Shin, M., & Triandopoulos, N. (2008) · Proceedings of the 6th international conference on Mobile systems, applications, and services · doi:10.1145/1378600.1378624 · Cited by 377
Blockchain 3.0 applications survey
Di Francesco Maesa, D., & Mori, P. (2020) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.12.019 · Cited by 372
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_9 · Cited by 357
Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs
Cho, H., Ippolito, D., & Yu, Y. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11511 · Cited by 350
Squealing 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
Preserving privacy in gps traces via uncertainty-aware path cloaking
Hoh, B., Gruteser, M., Xiong, H., & Alrabady, A. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315266 · Cited by 345
Overlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
Protecting Privacy Against Location-Based Personal Identification
Bettini, C., Wang, X. S., & Jajodia, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11552338_13 · Cited by 340
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnar, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_5 · Cited by 336
On Safeguarding Privacy and Security in the Framework of Federated Learning
Ma, C., Li, J., Ding, M., Yang, H. H., Shu, F., Quek, T. Q. S., & Poor, H. V. (2020) · IEEE Network · doi:10.1109/mnet.001.1900506 · Cited by 318
Hoepman, J.-H. (2014) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-3-642-55415-5_38 · Cited by 318
Security and Privacy in Device-to-Device (D2D) Communication: A Review
Haus, M., Waqas, M., Ding, A. Y., Li, Y., Tarkoma, S., & Ott, J. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2649687 · Cited by 318
A Conceptual Secure Blockchain Based Electronic Voting System
Ben Ayed, A. (2017) · International Journal of Network Security & Its Applications · doi:10.5121/ijnsa.2017.9301 · Cited by 315
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307
“[15] D. Chaum, ‘‘Untraceable electronic mail, return addresses, and digital pseudonyms,’’ Commun.”
BackgroundIntroducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Rennhard, M., & Plattner, B. (2002) · Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society · doi:10.1145/644527.644537 · Cited by 306
Gulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
Towards an Analysis of Onion Routing Security
Syverson, P., Tsudik, G., Reed, M., & Landwehr, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_6 · Cited by 302
Practical multi-candidate election system
Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., & Poupard, G. (2001) · Proceedings of the twentieth annual ACM symposium on Principles of distributed computing · doi:10.1145/383962.384044 · Cited by 301
Anonymous Web transactions with Crowds
Reiter, M. K., & Rubin, A. D. (1999) · Communications of the ACM · doi:10.1145/293411.293778 · Cited by 286
Stop- and- Go-MIXes Providing Probabilistic Anonymity in an Open System
Kesdogan, D., Egner, J., & Büschkes, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_7 · Cited by 285
Verifying privacy-type properties of electronic voting protocols
Delaune, S., Kremer, S., & Ryan, M. (2009) · Journal of Computer Security · doi:10.3233/jcs-2009-0340 · Cited by 285
Scalable blockchain model using off-chain IPFS storage for healthcare data security and privacy
Jayabalan, J., & Jeyanthi, N. (2022) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2022.03.009 · Cited by 282
Timing Attacks in Low-Latency Mix Systems
Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27809-2_25 · Cited by 277
Mix and Match: Secure Function Evaluation via Ciphertexts
Jakobsson, M., & Juels, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_13 · Cited by 276
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses
Shmatikov, V., & Wang, M.-H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11863908_2 · Cited by 273
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Kus Khalilov, M. C., & Levi, A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2818623 · Cited by 271
Addressing privacy requirements in system design: the PriS method
Kalloniatis, C., Kavakli, E., & Gritzalis, S. (2008) · Requirements Engineering · doi:10.1007/s00766-008-0067-3 · Cited by 269
Distributed Differential Privacy via Shuffling
Cheu, A., Smith, A., Ullman, J., Zeber, D., & Zhilyaev, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17653-2_13 · Cited by 268
Enhancing wireless location privacy using silent period
Huang, L., Matsuura, K., Yamane, H., & Sezaki, K. (2005) · IEEE Wireless Communications and Networking Conference, 2005 · doi:10.1109/wcnc.2005.1424677 · Cited by 259
Analyzing User-Level Privacy Attack Against Federated Learning
Song, M., Wang, Z., Zhang, Z., Song, Y., Wang, Q., Ren, J., & Qi, H. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3000372 · Cited by 257
Security models for web-based applications
Joshi, J. B. D., Aref, W. G., Ghafoor, A., & Spafford, E. H. (2001) · Communications of the ACM · doi:10.1145/359205.359224 · Cited by 255
Blindcoin: Blinded, Accountable Mixes for Bitcoin
Valenta, L., & Rowan, B. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48051-9_9 · Cited by 205
Metadata
- Authors
- Chaum, D. L.
- Venue
- Communications of the ACM
- Published
- 1981-02
- Volume
- 24
- Issue
- 2
- Pages
- 84-90
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2103647628
- Cited by
- 4,289
- References
- 4
- FWCI
- 1.16
- Type
- journal article
- 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.