The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Verifiable Delegation of Computation over Large Datasets
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
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
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
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
The 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
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · cited 1×
“Merkles trees [42] are a standard technique for efficient authentication of data.”
MethodPors: 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 Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
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
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
Self-citationTrading group theory for randomness
Babai, L. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22192 · Cited by 772
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
A note on efficient zero-knowledge proofs and arguments (extended abstract)
Kilian, J. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129782 · Cited by 606
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
IEICE transactions on fundamentals of electronics, communications and computer sciences
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 561
Certificate revocation and certificate update
Naor, M., & Nissim, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839932 · Cited by 493
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
Accumulators from Bilinear Pairings and Applications
Nguyen, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_19 · Cited by 431
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
Improved Delegation of Computation Using Fully Homomorphic Encryption
Chung, K.-M., Kalai, Y., & Vadhan, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_26 · Cited by 403
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2004) · Journal of the ACM · doi:10.1145/972639.972643 · Cited by 368
How to Securely Outsource Cryptographic Computations
Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_15 · Cited by 361
Building a high-performance, programmable secure coprocessor
Smith, S. W., & Weingart, S. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00019-x · Cited by 336
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Freeman, D. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_3 · Cited by 305
Micali, S. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365746 · Cited by 293
Mitsunari, S., Sakai, R., & Kasahara, M. (2002) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 279
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Uncheatable Distributed Computations
Golle, P., & Mironov, I. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_31 · Cited by 256
Yee, B. (1994) · Cited by 220
A General Model for Authenticated Data Structures
Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., & Stubblebine, S. G. (2004) · Algorithmica · doi:10.1007/s00453-003-1076-8 · Cited by 210
From Secrecy to Soundness: Efficient Verification via Secure Computation: (Extended Abstract)
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14165-2_14 · Cited by 198
Tamassia, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39658-1_2 · Cited by 190
Achieving Leakage Resilience through Dual System Encryption
Lewko, A., Rouselakis, Y., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_6 · Cited by 169
Optimal Verification of Operations on Dynamic Sets
Papamanthou, C., Tamassia, R., & Triandopoulos, N. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_6 · Cited by 144
Papamanthou, C., Tamassia, R., & Triandopoulos, N. (2008) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1455770.1455826 · Cited by 133
Checking the correctness of memories
Blum, M., Evans, W., Gemmell, P. S., et al. (2002) · doi:10.1109/sfcs.1991.185352 · Cited by 131
Distributed Execution with Remote Audit.
Monrose, F., Wyckoff, P., & Rubin, A. D. (1999) · Network and Distributed System Security Symposium · Cited by 109
Incentivizing outsourced computation
Belenkiy, M., Chase, M., Erway, C. C., Jannotti, J., Küpçü, A., & Lysyanskaya, A. (2008) · ACM International Workshop on Economics of Networked Systems (NetEcon) · doi:10.1145/1403027.1403046 · Cited by 102
Hazay, C., & Lindell, Y. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9034-x · Cited by 102
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Lewko, A. B., & Waters, B. R. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653677 · Cited by 69
Improved Efficient Arguments (Preliminary Version)
Kilian, J. (1995) · International Cryptology Conference · Cited by 56
Cited by
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data
Zheng, Q., Xu, S., & Ateniese, G. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6847976 · Cited by 499
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Parno, B., Raykova, M., & Vaikuntanathan, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28914-9_24 · Cited by 355
New Algorithms for Secure Outsourcing of Modular Exponentiations
Chen, X., Li, J., Ma, J., Tang, Q., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.180 · Cited by 307
Smart 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
- Benabbas, S., Gennaro, R., & Vahlis, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 111-131
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2136936712
- Cited by
- 379
- References
- 48
- FWCI
- 26.88
- 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.