Fetching the paper…
Reading the bibliography…
As organizations struggle with processing vast amounts of information, outsourcing sensitive data to third parties becomes a necessity.
Understanding hierarchical methods for differentially private histograms
Wahbeh Qardaji, Weining Yang, and Ninghui Li. 2013 · 1965
Earlier work this paper cites.
Towards a theory of software protection and simulation by oblivious RAMs. In Proceedings of the nineteenth annual ACM symposium on Theory of computing . 182–194
Oded Goldreich. 1987 · 1987
Earlier work this paper cites.
Software protection and simulation on oblivious RAMs
Oded Goldreich and Rafail Ostrovsky. 1996 · 1996
Earlier work this paper cites.
Recommendation for Block Cipher Modes of Operation: Methods and Techniques
Morris Dworkin. 2001 · 2001
Earlier work this paper cites.
Advanced Encryption Standard (AES)
Morris Dworkin, Elaine Barker, James Nechvatal, James Foti, Lawrence Bassham, E. Roback, and James Dray. 2001 · 2001
Earlier work this paper cites.
Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data . 19–30
Frank D McSherry. 2009 · 2009
Earlier work this paper cites.
Computational differential privacy. In Annual International Cryptology Conference . Springer, 126–142
Ilya Mironov, Omkant Pandey, Omer Reingold, and Salil Vadhan. 2009 · 2009
Earlier work this paper cites.
Differential privacy under continual observation. In Proceedings of the forty-second ACM symposium on Theory of computing . 715–724
Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N Rothblum. 2010 · 2010
Earlier work this paper cites.
Computing arbitrary functions of encrypted data
Craig Gentry. 2010 · 2010
Earlier work this paper cites.
Boosting the Accuracy of Differentially Private Histograms through Consistency
Michael Hay, Vibhor Rastogi, Gerome Miklau, and Dan Suciu. 2010 · 2010
Earlier work this paper cites.
Differential privacy via wavelet transforms
Xiaokui Xiao, Guozhang Wang, and Johannes Gehrke. 2010 · 2010
Earlier work this paper cites.
CryptDB: Protecting confidentiality with encrypted query processing. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles . 85–100
Raluca Ada Popa, Catherine MS Redfield, Nickolai Zeldovich, and Hari Balakrishnan. 2011 · 2011
Earlier work this paper cites.
Oblivious RAM with O ( log 3 N ) O(\log^{3}N) worst-case cost. In International Conference on The Theory and Application of Cryptology and Information Security . Springer, 197–214
Elaine Shi, T-H Hubert Chan, Emil Stefanov, and Mingfei Li. 2011 · 2011
Earlier work this paper cites.
Counting triangles and the curse of the last reducer. In Proceedings of the 20th international conference on World wide web . 607–614
Siddharth Suri and Sergei Vassilvitskii. 2011 · 2011
Earlier work this paper cites.
Computing blindfolded: New developments in fully homomorphic encryption. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science . IEEE, 5–16
Vinod Vaikuntanathan. 2011 · 2011
Earlier work this paper cites.
Secure multidimensional range queries over outsourced data
Bijit Hore, Sharad Mehrotra, Mustafa Canim, and Murat Kantarcioglu. 2012 · 2012
Earlier work this paper cites.
Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA, February 5-8, 2012 . The Internet Society
Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012 · 2012
Earlier work this paper cites.
Towards Practical Oblivious RAM. In Network and Distributed System Security Symposium (NDSS)
Emil Stefanov, Elaine Shi, and Dawn Xiaodong Song. 2012 · 2012
Earlier work this paper cites.
Secure Database-as-a-Service with Cipherbase. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD ’13) . Association for Computing Machinery, 1033–1036
Arvind Arasu, Spyros Blanas, Ken Eguro, Manas Joglekar, Raghav Kaushik, Donald Kossmann, Ravi Ramamurthy, Prasang Upadhyaya, and Ramarathnam Venkatesan. 2013a · 2013
Earlier work this paper cites.
TrustedDB: A trusted hardware-based database with privacy and data confidentiality
Sumeet Bajaj and Radu Sion. 2013 · 2013
Earlier work this paper cites.
Private learning and sanitization: Pure vs. approximate differential privacy
Amos Beimel, Kobbi Nissim, and Uri Stemmer. 2013 · 2013
Earlier work this paper cites.
A learning theory approach to non-interactive database privacy
Avrim Blum, Katrina Ligett, and Aaron Roth. 2013 · 2013
Earlier work this paper cites.
Path ORAM: an extremely simple oblivious RAM protocol. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security . 299–310
Emil Stefanov, Marten Van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. 2013 · 2013
Earlier work this paper cites.
Bounds on the sample complexity for private learning and private data release
Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, and Kobbi Nissim. 2014 · 2014
Cited alongside, same era.
Differential privacy: An economic method for choosing epsilon. In 2014 IEEE 27th Computer Security Foundations Symposium . IEEE, 398–410
Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin C Pierce, and Aaron Roth. 2014 · 2014
Cited alongside, same era.
Inference attack against encrypted range queries on outsourced databases. In Proceedings of the 4th ACM conference on Data and application security and privacy . 235–246
Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2014 · 2014
Cited alongside, same era.
Privacy-preserving complex query evaluation over semantically secure encrypted data. In European Symposium on Research in Computer Security . Springer, 400–418
Bharath Kumar Samanthula, Wei Jiang, and Elisa Bertino. 2014 · 2014
Cited alongside, same era.
Pump up the volume: Practical database reconstruction from volume leakage on range queries. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security . 315–331
Paul Grubbs, Marie-Sarah Lacharité, Brice Minaud, and Kenneth G Paterson. 2018 · 2018
Closest in time.
Improved reconstruction attacks on encrypted data using range query leakage. In 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 297–314
Marie-Sarah Lacharité, Brice Minaud, and Kenneth G Paterson. 2018 · 2018
Closest in time.
Oblix: An efficient oblivious search index. In 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 279–296
Pratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa, and Raluca Ada Popa. 2018 · 2018
Closest in time.
EnclaveDB: A secure database using SGX. In 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 264–278
Christian Priebe, Kapil Vaswani, and Manuel Costa. 2018 · 2018
Closest in time.
A Differentially Private Index for Range Query Processing in Clouds. In 2018 IEEE 34th International Conference on Data Engineering (ICDE) . 857–868
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mark Bun, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. 2015 · 2015
Cited alongside, same era.
Leakage-abuse attacks against searchable encryption. In Proceedings of the 22nd ACM SIGSAC conference on computer and communications security . 668–679
David Cash, Paul Grubbs, Jason Perry, and Thomas Ristenpart. 2015 · 2015
Cited alongside, same era.
Inference attacks on property-preserving encrypted databases. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security . 644–655
Muhammad Naveed, Seny Kamara, and Charles V Wright. 2015 · 2015
Cited alongside, same era.
Secure Hash Standard (SHS)
National Institute of Standards and Technology. 2015 · 2015
Cited alongside, same era.
Oblivious RAM: A dissection and experimental evaluation
Zhao Chang, Dong Xie, and Feifei Li. 2016 · 2016
Cited alongside, same era.
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. In Theory of Cryptography , Eyal Kushilevitz and Tal Malkin (Eds.). Springer Berlin Heidelberg, 205–234
Binyi Chen, Huijia Lin, and Stefano Tessaro. 2016 · 2016
Cited alongside, same era.
Practical private range search revisited. In Proceedings of the 2016 International Conference on Management of Data . 185–198
Ioannis Demertzis, Stavros Papadopoulos, Odysseas Papapetrou, Antonios Deligiannakis, and Minos Garofalakis. 2016 · 2016
Cited alongside, same era.
Private large-scale databases with distributed searchable symmetric encryption. In Cryptographers’ Track at the RSA Conference . Springer, 90–107
Yuval Ishai, Eyal Kushilevitz, Steve Lu, and Rafail Ostrovsky. 2016 · 2016
Cited alongside, same era.
Cetin Sahin, Tristan Allard, Reza Akbarinia, Amr El Abbadi, and Esther Pacitti. 2018 · 2018
Closest in time.
American Community Survey Public Use Microdata Sample
U.S. Census Bureau. 2018 · 2018
Closest in time.
Exploring Differential Obliviousness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 145) . Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 65:1–65:20
Amos Beimel, Kobbi Nissim, and Mohammad Zaheri. 2019 · 2019
Closest in time.
A comparative evaluation of order-revealing encryption schemes and secure range-query protocols
Dmytro Bogatov, George Kollios, and Leonid Reyzin. 2019 · 2019
Closest in time.
Foundations of Differentially Oblivious Algorithms. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (San Diego, California) (SODA ’19) . Society for Industrial and Applied Mathematics, USA, 2448–2467
T-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, and Elaine Shi. 2019 · 2019
Closest in time.
ObliDB: Oblivious query processing for secure databases
Saba Eskandarian and Matei Zaharia. 2019 · 2019
Closest in time.
Encrypted databases: New volume attacks against range queries. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security . 361–378
Zichen Gui, Oliver Johnson, and Bogdan Warinschi. 2019 · 2019
Closest in time.
Arx: an encrypted database using semantically secure encryption
Rishabh Poddar, Tobias Boelter, and Raluca Ada Popa. 2019 · 2019
Closest in time.
California public pay and pension 2019 dataset
Transparent California. 2019 · 2019
Closest in time.
StealthDB: a scalable encrypted database with full SQL query support
Dhinakaran Vinayagamurthy, Alexey Gribov, and Sergey Gorbunov. 2019 · 2019
Closest in time.
Hermetic: Privacy-preserving distributed analytics without (most) side channels
Min Xu, Antonis Papadimitriou, Andreas Haeberlen, and Ariel Feldman. 2019 · 2019
Closest in time.
SEAL: Attack Mitigation for Encrypted Databases via Adjustable Leakage. In 29th USENIX Security Symposium (USENIX Security 20) . USENIX Association, 2433–2450
Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, and Saurabh Shintre. 2020 · 2020
Closest in time.
Privately Learning Thresholds: Closing the Exponential Gap. In Proceedings of Thirty Third Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 125) . PMLR, 2263–2285
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, and Uri Stemmer. 2020 · 2020
Closest in time.
The state of the uniform: attacks on encrypted databases beyond the uniform query distribution. In 2020 IEEE Symposium on Security and Privacy (SP) . IEEE, 1223–1240
Evgenios M Kornaropoulos, Charalampos Papamanthou, and Roberto Tamassia. 2020 · 2020
Closest in time.
Lower Bounds for Multi-server Oblivious RAMs. In Theory of Cryptography . Springer International Publishing, 486–503
Kasper Green Larsen, Mark Simkin, and Kevin Yeo. 2020 · 2020
Closest in time.
Crypt ϵ \epsilon : Crypto-assisted differential privacy on untrusted servers. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data . 603–619
Amrita Roy Chowdhury, Chenghong Wang, Xi He, Ashwin Machanavajjhala, and Somesh Jha. 2020 · 2020
Closest in time.
Original and procesed datasets used in this paper
Dmytro Bogatov. 2021c · 2021
Closest in time.
MS-SQL Always Encrypted
Microsoft. 2021 · 2021
Closest in time.
Introduction to Transparent Data Encryption
Oracle. 2021 · 2021
Closest in time.