The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An Oblivious Transfer Protocol with Log-Squared Communication
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Replication is not needed: single database, computationally-private information retrieval
Kushilevitz, E., & Ostrovsky, R. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646125 · Cited by 932
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
Efficient oblivious transfer protocols
Naor, M., & Benny Pinkas, B. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365502 · Cited by 614
Computationally Private Information Retrieval with Polylogarithmic Communication
Cachin, C., Micali, S., & Stadler, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_28 · Cited by 579
Priced Oblivious Transfer: How to Sell Digital Goods
Aiello, B., Ishai, Y., & Reingold, O. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_8 · Cited by 400
Secure Vickrey Auctions without Threshold Trust
Lipmaa, H., Asokan, N., & Niemi, V. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_7 · Cited by 174
Self-citationSingle Database Private Information Retrieval with Logarithmic Communication
Chang, Y.-C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_5 · Cited by 162
Cited by
Pors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
SIA: secure information aggregation in sensor networks
Przydatek, B., Song, D., & Perrig, A. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958521 · Cited by 789
Delegating computation: interactive proofs for muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374396 · Cited by 484
Keyword Search and Oblivious Pseudorandom Functions
Freedman, M. J., Ishai, Y., Pinkas, B., & Reingold, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_17 · Cited by 441
Function Secret Sharing: Improvements and Extensions
Boyle, E., Gilboa, N., & Ishai, Y. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978429 · Cited by 358
Boyle, E., Gilboa, N., & Ishai, Y. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_12 · Cited by 328
Single-Database Private Information Retrieval with Constant Communication Rate
Gentry, C., & Ramzan, Z. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_65 · Cited by 313
SIA: Secure information aggregation in sensor networks
Chan, H., Perrig, A., Przydatek, B., & Song, D. (2007) · Journal of Computer Security · doi:10.3233/jcs-2007-15104 · Cited by 309
XPIR: Private information retrieval for everyone
Aguilar-Melchor, C., Barrier, J., Fousse, L., & Killijian, M.-O. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0010 · Cited by 185
Metadata
- Authors
- Lipmaa, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 314-328
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1511913323
- Cited by
- 271
- References
- 12
- FWCI
- 16.69
- 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.