The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Privacy-Friendly Aggregation for the Smart-Grid
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
Data Analysis Using Regression and Multilevel/Hierarchical Models
Gelman, A., & Hill, J. (2006) · doi:10.1017/cbo9780511790942 · Cited by 13,597
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
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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
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
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
(2005) · Codes · doi:10.1201/9781420035087-10 · Cited by 913
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
Private memoirs of a smart meter
Molina-Markham, A., Shenoy, P., Fu, K., Cecchet, E., & Irwin, D. (2010) · Proceedings of the 2nd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Building · doi:10.1145/1878431.1878446 · Cited by 511
Privacy-Friendly Energy-Metering via Homomorphic Encryption
Garcia, F. D., & Jacobs, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22444-7_15 · Cited by 338
Privacy-preserving smart metering
Rial, A., & Danezis, G. (2011) · Proceedings of the 10th annual ACM workshop on Privacy in the electronic society · doi:10.1145/2046556.2046564 · Cited by 312
Self-citationOff-the-record communication, or, why not to use PGP
Borisov, N., Goldberg, I., & Brewer, E. (2004) · Proceedings of the 2004 ACM workshop on Privacy in the electronic society · doi:10.1145/1029179.1029200 · Cited by 269
Proof systems for general statements about discrete logarithms
Camenisch, J. L., & Stadler, M. A. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006651937 · Cited by 220
Dining Cryptographers Revisited
Golle, P., & Juels, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_27 · Cited by 168
Smart Grid Cyber Security Strategy and Requirements
Lee, A., & Brewer, T. L. (2009) · National Institute of Standards and Technology (U.S.) · Cited by 89
A 2-Round Anonymous Veto Protocol
Hao, F., & Zieliński, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04904-0_28 · Cited by 72
Cited by
A Lightweight Message Authentication Scheme for Smart Grid Communications
Fouda, M. M., Fadlullah, Z. M., Kato, N., Lu, R., & Shen, X. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2160661 · Cited by 457
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
An overview of security and privacy in smart cities' IoT communications
Al‐Turjman, F., Zahmatkesh, H., & Shahroze, R. (2022) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.3677 · Cited by 313
Privacy-preserving smart metering
Rial, A., & Danezis, G. (2011) · Proceedings of the 10th annual ACM workshop on Privacy in the electronic society · doi:10.1145/2046556.2046564 · Cited by 312
Self-citationSmart Meter Data Privacy: A Survey
Asghar, M. R., Dan, G., Miorandi, D., & Chlamtac, I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 307
Metadata
- Authors
- Kursawe, K., Danezis, G., & Kohlweiss, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 175-191
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1546167911
- Cited by
- 378
- References
- 20
- FWCI
- 55.82
- 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.