The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
ObliVM: A Programming Framework for Secure Computation
Open accessAbstract
We design and develop ObliVM, a programming framework for secure computation. ObliVM offers a domain specific language designed for compilation of programs into efficient oblivious representations suitable for secure computation. ObliVM offers a powerful, expressive programming language and user-friendly oblivious programming abstractions. We develop various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrate the scalability of ObliVM to bigger data sizes. We also show how ObliVM significantly reduces development effort while retaining competitive performance for a wide range of applications in comparison with hand-crafted solutions. We are in the process of open-sourcing ObliVM and our rich libraries to the community (www.oblivm.com), offering a reusable framework to implement and distribute new cryptographic algorithms.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
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
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
Sharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Efficient oblivious transfer protocols
Naor, M., & Benny Pinkas, B. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365502 · Cited by 614
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
Self-citationTowards a theory of software protection and simulation by oblivious RAMs
Goldreich, O. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28416 · Cited by 507
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.30 · Cited by 439
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates
Zahur, S., Rosulek, M., & Evans, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_8 · Cited by 367
More efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Agat, J. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325702 · Cited by 340
Efficient Garbling from a Fixed-Key Blockcipher
Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.39 · Cited by 304
Privacy-preserving matrix factorization
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., & Boneh, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516751 · Cited by 271
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound
Wang, X., Chan, H., & Shi, E. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813634 · Cited by 225
Self-citationTinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits
Songhori, E. M., Hussain, S. U., Sadeghi, A.-R., Schneider, T., & Koushanfar, F. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.32 · Cited by 210
Privacy-Preserving Graph Algorithms in the Semi-honest Model
Brickell, J., & Shmatikov, V. (2005) · Lecture notes in computer science · doi:10.1007/11593447_13 · Cited by 157
SCORAM: Oblivious RAM for Secure Computation
Wang, X. S., Huang, Y., Chan, T.-H. H., Shelat, A. A., & Shi, E. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660365 · Cited by 146
Self-citationGraphSC: Parallel Secure Computation Made Easy
Nayak, K., Wang, X. S., Ioannidis, S., Weinsberg, U., Taft, N., & Shi, E. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.30 · Cited by 145
Self-citationEfficient RAM and Control Flow in Verifiable Outsourced Computation
Wahby, R. S., Setty, S., Ren, Z., Blumberg, A. J., & Walfish, M. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23097 · Cited by 141
Efficient, Oblivious Data Structures for MPC
Keller, M., & Schöll, P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45608-8_27 · Cited by 136
Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations
Rastogi, A., Hammer, M. A., & Hicks, M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.48 · Cited by 134
Secure two-party computations in ANSI C
Holzer, A., Franz, M., Katzenbeisser, S., & Veith, H. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382278 · Cited by 125
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates.
Zahur, S., Rosulek, M., & Evans, D. (2014) · Cited by 112
Automating Efficient RAM-Model Secure Computation
Liu, C., Huang, Y., Shi, E., Katz, J. I., & Hicks, M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.46 · Cited by 104
Self-citationData-oblivious graph algorithms for secure computation and outsourcing
Blanton, M., Steele, A., & Alisagari, M. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484341 · Cited by 96
On the Security of the “Free-XOR” Technique
Choi, S. G., Katz, J. I., Kumaresan, R., & Zhou, H.-S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_3 · Cited by 94
Zhang, Y., Steele, A., & Blanton, M. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516752 · Cited by 86
Memory Trace Oblivious Program Execution
Liu, C., Hicks, M., & Shi, E. (2013) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2013.11 · Cited by 69
Self-citationThe Complexity of Computations
Pudlák, P. (2013) · Springer monographs in mathematics · doi:10.1007/978-3-319-00119-7_5 · Cited by 57
Koblitz, N. (1998) · Algorithms and computation in mathematics · doi:10.1007/978-3-662-03642-6_2 · Cited by 57
Closing Internal Timing Channels by Transformation
Russo, A., Hughes, J., Naumann, D. A., & Sabelfeld, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77505-8_10 · Cited by 49
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound
Wang, X. S., Chan, T.-H. H., & Shi, E. (n.d.) · Cited by 40
Self-citationGarbling XOR Gates “For Free” in the Standard Model
Applebaum, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_10 · Cited by 27
Privacy-preserving microbiome analysis using secure computation
Wagner, J., Paulson, J. N., Wang, X., Bhattacharjee, B., & Bravo, H. C. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw073 · Cited by 22
Self-citation
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
Self-citationEkiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts
Cheng, R., Zhang, F., Kos, J., He, W., Hynes, N., Johnson, N., Juels, A., Miller, A., & Song, D. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00023 · Cited by 431
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F. (2018) · Proceedings of the 2018 on Asia Conference on Computer and Communications Security · doi:10.1145/3196494.3196522 · Cited by 410
A Digital Twin Based Industrial Automation and Control System Security Architecture
Gehrmann, C., & Gunnarsson, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938885 · Cited by 353
CrypTFlow: Secure TensorFlow Inference
Kumar, N., Rathee, M., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00092 · Cited by 245
Metadata
- Authors
- Liu, C., Wang, X. S., Nayak, K., Huang, Y., & Shi, E.
- Venue
- 2015 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2015-05
- Pages
- 359-376
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1520270249
- Cited by
- 307
- References
- 45
- FWCI
- 23.86
- Type
- conference paper
- 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.