default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmil Stefanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Emil Stefanov, Marten van Dijk
, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
A Retrospective on Path ORAM. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(8): 1572-1576 (2020)
2010 – 2019
- 2018
- [j5]Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
Path ORAM: An Extremely Simple Oblivious RAM Protocol. J. ACM 65(4): 18:1-18:26 (2018) - 2015
- [c19]Christopher W. Fletcher, Ling Ren, Albert Kwon, Marten van Dijk, Emil Stefanov, Dimitrios N. Serpanos, Srinivas Devadas:
A Low-Latency, Low-Area Hardware Oblivious RAM Controller. FCCM 2015: 215-222 - [c18]Ling Ren, Christopher W. Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, Srinivas Devadas:
Constants Count: Practical Improvements to Oblivious RAM. USENIX Security Symposium 2015: 415-430 - [i14]Christopher W. Fletcher, Muhammad Naveed, Ling Ren, Elaine Shi, Emil Stefanov:
Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM. IACR Cryptol. ePrint Arch. 2015: 1065 (2015) - 2014
- [j4]Neil Zhenqiang Gong, Ameet Talwalkar, Lester W. Mackey, Ling Huang, Eui Chul Richard Shin, Emil Stefanov, Elaine Shi, Dawn Song:
Joint Link Prediction and Attribute Inference Using a Social-Attribute Network. ACM Trans. Intell. Syst. Technol. 5(2): 27:1-27:20 (2014) - [c17]Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang:
Oblivious Data Structures. CCS 2014: 215-226 - [c16]Emil Stefanov, Charalampos Papamanthou, Elaine Shi:
Practical Dynamic Searchable Encryption with Small Leakage. NDSS 2014 - [c15]Jonathan L. Dautrich Jr., Emil Stefanov, Elaine Shi:
Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns. USENIX Security Symposium 2014: 749-764 - [i13]Xiao Wang, Kartik Nayak, Chang Liu, Elaine Shi, Emil Stefanov, Yan Huang:
Oblivious Data Structures. IACR Cryptol. ePrint Arch. 2014: 185 (2014) - [i12]Christopher W. Fletcher, Ling Ren, Albert Kwon, Marten van Dijk, Emil Stefanov, Srinivas Devadas:
RAW Path ORAM: A Low-Latency, Low-Area Hardware ORAM Controller with Integrity Verification. IACR Cryptol. ePrint Arch. 2014: 431 (2014) - [i11]Ling Ren, Christopher W. Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, Srinivas Devadas:
Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM. IACR Cryptol. ePrint Arch. 2014: 997 (2014) - 2013
- [j3]Zygmunt Pizlo, Emil Stefanov:
Solving Large Problems with a Small Working Memory. J. Probl. Solving 6(1) (2013) - [c14]Emil Stefanov, Elaine Shi:
Multi-cloud oblivious storage. CCS 2013: 247-258 - [c13]Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
Path ORAM: an extremely simple oblivious RAM protocol. CCS 2013: 299-310 - [c12]Martin Maas, Eric Love, Emil Stefanov, Mohit Tiwari, Elaine Shi, Krste Asanovic, John Kubiatowicz, Dawn Song:
PHANTOM: practical oblivious computation in a secure processor. CCS 2013: 311-324 - [c11]Elaine Shi, Emil Stefanov, Charalampos Papamanthou:
Practical dynamic proofs of retrievability. CCS 2013: 325-336 - [c10]Emil Stefanov, Elaine Shi:
ObliviStore: High Performance Oblivious Distributed Cloud Data Store. NDSS 2013 - [c9]Emil Stefanov, Elaine Shi:
ObliviStore: High Performance Oblivious Cloud Storage. IEEE Symposium on Security and Privacy 2013: 253-267 - [i10]Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
Path ORAM: An Extremely Simple Oblivious RAM Protocol. IACR Cryptol. ePrint Arch. 2013: 280 (2013) - [i9]Emil Stefanov, Charalampos Papamanthou, Elaine Shi:
Practical Dynamic Searchable Encryption with Small Leakage. IACR Cryptol. ePrint Arch. 2013: 832 (2013) - 2012
- [c8]Emil Stefanov, Marten van Dijk, Ari Juels, Alina Oprea:
Iris: a scalable cloud file system with efficient integrity checks. ACSAC 2012: 229-238 - [c7]Marten van Dijk, Ari Juels, Alina Oprea, Ronald L. Rivest, Emil Stefanov, Nikos Triandopoulos:
Hourglass schemes: how to prove that cloud files are encrypted. CCS 2012: 265-280 - [c6]Neil Zhenqiang Gong, Wenchang Xu, Ling Huang, Prateek Mittal, Emil Stefanov, Vyas Sekar, Dawn Song:
Evolution of social-attribute networks: measurements, modeling, and implications using google+. Internet Measurement Conference 2012: 131-144 - [c5]Emil Stefanov, Elaine Shi, Dawn Xiaodong Song:
Towards Practical Oblivious RAM. NDSS 2012 - [c4]Emil Stefanov, Elaine Shi, Dawn Song:
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies. Public Key Cryptography 2012: 413-430 - [c3]Arvind Narayanan, Hristo S. Paskov, Neil Zhenqiang Gong, John Bethencourt, Emil Stefanov, Eui Chul Richard Shin, Dawn Song:
On the Feasibility of Internet-Scale Author Identification. IEEE Symposium on Security and Privacy 2012: 300-314 - [i8]Emil Stefanov, Elaine Shi:
Path O-RAM: An Extremely Simple Oblivious RAM Protocol. CoRR abs/1202.5150 (2012) - [i7]Neil Zhenqiang Gong, Wenchang Xu, Ling Huang, Prateek Mittal, Emil Stefanov, Vyas Sekar, Dawn Song:
Evolution of Social-Attribute Networks: Measurements, Modeling, and Implications using Google+. CoRR abs/1209.0835 (2012) - [i6]Emil Stefanov, Elaine Shi:
FastPRP: Fast Pseudo-Random Permutations for Small Domains. IACR Cryptol. ePrint Arch. 2012: 254 (2012) - 2011
- [j2]Yll Haxhimusa, Edward Carpenter, Joseph Catrambone, David Foldes, Emil Stefanov, Laura L. Arns, Zygmunt Pizlo:
2D and 3D Traveling Salesman Problem. J. Probl. Solving 3(2) (2011) - [c2]Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((logN)3) Worst-Case Cost. ASIACRYPT 2011: 197-214 - [i5]Emil Stefanov, Elaine Shi, Dawn Song:
Towards Practical Oblivious RAM. CoRR abs/1106.3652 (2011) - [i4]Neil Zhenqiang Gong, Ameet Talwalkar, Lester W. Mackey, Ling Huang, Eui Chul Richard Shin, Emil Stefanov, Elaine Shi, Dawn Song:
Predicting Links and Inferring Attributes using a Social-Attribute Network (SAN). CoRR abs/1112.3265 (2011) - [i3]Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Mingfei Li:
Oblivious RAM with O((log N)3) Worst-Case Cost. IACR Cryptol. ePrint Arch. 2011: 407 (2011) - [i2]Emil Stefanov, Elaine Shi, Dawn Song:
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies. IACR Cryptol. ePrint Arch. 2011: 509 (2011) - [i1]Emil Stefanov, Marten van Dijk, Alina Oprea, Ari Juels:
Iris: A Scalable Cloud File System with Efficient Integrity Checks. IACR Cryptol. ePrint Arch. 2011: 585 (2011) - 2010
- [c1]Emil Stefanov, Mikhail J. Atallah:
Duress detection for authentication attacks against multiple administrators. Insider Threats@CCS 2010: 37-46
2000 – 2009
- 2006
- [j1]Zygmunt Pizlo, Emil Stefanov, John Saalweachter, Zheng Li, Yll Haxhimusa, Walter G. Kropatsch:
Traveling Salesman Problem: A Foveating Pyramid Model. J. Probl. Solving 1(1) (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
