Filters








2,670 Hits in 3.0 sec

Parallel and Dynamic Searchable Symmetric Encryption [chapter]

Seny Kamara, Charalampos Papamanthou
2013 Lecture Notes in Computer Science  
With roughly a logarithmic number of cores in place, searches for a keyword w in our scheme execute in o(r) parallel time, where r is the number of documents containing keyword w (with more cores, this  ...  Our technique is simple and uses a red-black tree data structure; its security is proven in the random oracle model.  ...  The authors would like to thank Elaine Shi, Dawn Song, Emil Stefanov and Tom Roeder for useful discussions.  ... 
doi:10.1007/978-3-642-39884-1_22 fatcat:pqrlb3le7vf5ddbsdpsxodbjcq

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption [chapter]

Sanjam Garg, Payman Mohassel, Charalampos Papamanthou
2016 Lecture Notes in Computer Science  
The server accesses memory M obliviously and returns encrypted information containing the desired value M[y].  ...  TWORAM substantially improves the worst-case asymptotic complexity of existing round-optimal ORAM protocols and gives rise to interesting applications, and in particular to a 4-round searchable encryption  ...  These lookups can all be performed in parallel and updating the paths can be piggybacked to the next keyword search. The above yields a construction with 4 rounds of interaction.  ... 
doi:10.1007/978-3-662-53015-3_20 fatcat:ucmsknobfnaordque3liiq45d4

Arx

Rishabh Poddar, Tobias Boelter, Raluca Ada Popa
2019 Proceedings of the VLDB Endowment  
In this paper, we propose Arx, a practical and functionally rich database system that encrypts the data only with semantically secure encryption schemes.  ...  We show that Arx supports real applications such as ShareLaTeX with a modest performance overhead.  ...  , Google, Intel, Microsoft, NVIDIA, ScotiaBank, Splunk, and VMWare.  ... 
doi:10.14778/3342263.3342641 fatcat:7rqpyv6n2rglth2h6wruknr4mu

Pindex: Private multi-linked index for encrypted document retrieval

A. John Prakash, B. Lydia Elizabeth, Anandakumar Haldorai
2021 PLoS ONE  
Therefore, the challenge is to design an efficient searchable encryption scheme with dynamic updates and forward privacy guarantees.  ...  The continuous growth of encrypted data outsourced to cloud storage requires continuous updating.  ...  Aura [36] use a non-interative DSSE using bloom filters and multi-puncturable PRF. Wei et al. [37] proposed an index structure with keyed block chain.  ... 
doi:10.1371/journal.pone.0256223 pmid:34415945 pmcid:PMC8378705 fatcat:a346zgj4ijbsvc54xmmle7afwi

An Ideal-Security Protocol for Order-Preserving Encoding

R. A. Popa, F. H. Li, N. Zeldovich
2013 2013 IEEE Symposium on Security and Privacy  
Our resulting protocol is interactive, with a small number of interactions.  ...  We implemented our scheme and evaluated it on microbenchmarks and in the context of an encrypted MySQL database application.  ...  ACKNOWLEDGMENTS We thank Emily Stark, the anonymous reviewers, and our shepherd, SrdanČapkun, for their feedback. This work was supported by NSF award IIS-1065219 and by Google.  ... 
doi:10.1109/sp.2013.38 dblp:conf/sp/PopaLZ13 fatcat:p7ro56fubncxnneumzl4n4qmya

An approach to cooperative updates of XML documents in distributed systems*

E. Bertino, E. Ferrari, G. Mella
2005 Journal of Computer Security  
Protection and secure exchange of Web documents is becoming a crucial need for many internetbased applications.  ...  Here we briefly discuss two alternative approaches referred to as restricted parallel update and fully parallel update.  ...  The control data structure for non-modifiable regions also contains the encryption of the content and the control information associated with the atomic elements belonging to non-modifiable regions.  ... 
doi:10.3233/jcs-2005-13201 fatcat:ptkr3noel5d2lle3ooova2ep5e

Blind Seer: A Scalable Private DBMS

Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos Keromytis, Steve Bellovin
2014 2014 IEEE Symposium on Security and Privacy  
We consider scalable DBMS with provable security for all parties, including protection of the data from both server (who stores encrypted data) and client (who searches it), as well as protection of the  ...  We also support private and complex access policies, integrated in the search process so that a query with empty result set and a query that fails the policy are hard to tell apart. Design goals.  ...  Any opinion, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1109/sp.2014.30 dblp:conf/sp/PappasKVKMCGKB14 fatcat:muuma54ttnhktbsf3fakm2soom

Building an Encrypted, Distributed, and Searchable Key-value Store

Xingliang Yuan, Xinyu Wang, Cong Wang, Chen Qian, Jianxiong Lin
2016 Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16  
simultaneously, and further enable secure query processing in parallel.  ...  In this paper, we focus on designing and implementing an encrypted, distributed, and searchable key-value store.  ...  Besides, even if they can be applied by treating the non-encrypted key-value store as the black box, a large number of connections and interactions would be introduced between the data node and the index  ... 
doi:10.1145/2897845.2897852 dblp:conf/ccs/YuanWWQL16 fatcat:67ox2tjq4vbhfkanccgf6x7324

PrivateFS

Peter Williams, Radu Sion, Alin Tomescu
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
Privatefs is based on a new parallel Oblivious RAM mechanism (PD-ORAM)-instead of waiting for the completion of all ongoing client-server transactions, client threads can now engage a server in parallel  ...  It performs multiple queries per second on a 1TB+ database across 50ms latency links, with unamortized, bound query latencies.  ...  Existence of an adversary with non-negligible advantage at violating query privacy (as in Definition 18 [2] ) in a parallel ORAM implies existence of an adversary with non-negligible advantage at violating  ... 
doi:10.1145/2382196.2382299 dblp:conf/ccs/WilliamsST12 fatcat:zlz2cnu4hjazba4lkq5blkh2te

Non-interactive Private Decision Tree Evaluation [chapter]

Anselme Tueno, Yordan Boev, Florian Kerschbaum
2020 Lecture Notes in Computer Science  
As a result, we are able to provide the first non-interactive protocol, that allows the client to delegate the evaluation to the server by sending an encrypted input and receiving only the encryption of  ...  However, since current somewhat homomorphic encryption schemes have high overhead, we combine efficient data representations with different algorithmic optimizations to keep the computational overhead  ...  Then, they traverse the tree interactively and use secure array indexing to select the next node and attribute. Kiss et al.  ... 
doi:10.1007/978-3-030-49669-2_10 fatcat:wzomzihvwjdqxlznwezejwar6u

Streamlining Integrity Tree Updates for Secure Persistent Non-Volatile Memory [article]

Alexander Freij, Shougang Yuan, Huiyang Zhou, Yan Solihin
2020 arXiv   pre-print
Emerging non-volatile main memory (NVMM) is rapidly being integrated into computer systems. However, NVMM is vulnerable to potential data remanence and replay attacks.  ...  Established security models including split counter mode encryption and Bonsai Merkle tree (BMT) authentication have been introduced against such data integrity attacks.  ...  The PTT interacts with a scheduler that also interacts with the BMT cache and the MC / WPQ. Each entry in the PTT has multiple fields ( Figure 6 ).  ... 
arXiv:2003.04693v1 fatcat:y3nlp3z3sjfuvbs736djfkerpe

SecureScala: Scala embedding of secure computations

Markus Hauck, Savvas Savvides, Patrick Eugster, Mira Mezini, Guido Salvaneschi
2016 Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala - SCALA 2016  
SecureScala is based on a novel combination of free monads and free applicative functors and supports parallel execution and static analyzability.  ...  Partial homomorphic encryption is promising for secure computation, since it allows programs to be executed over encrypted data.  ...  Acknowledgments This work has been supported by European Research Council grants #FP7-321217 and #FP7-617805, the German Science Foundation grants #SFB-1119 and #SFB-1053, the Northrop Grumman Cybersecurity  ... 
doi:10.1145/2998392.2998403 dblp:conf/scala/HauckSEMS16 fatcat:6clxjluvcbbphhfjee7ue22n2u

An encryption-based access control framework for content-centric networking

Jun Kuriharay, Ersin Uzun, Christopher A. Wood
2015 2015 IFIP Networking Conference (IFIP Networking)  
The design of CCN-AC heavily relies on the concept of secure content object manifests and leverages them to decouple encrypted content from access policy and specifications for minimum communication overhead  ...  and maximum utilization of in-network caches.  ...  For example, more sophisticated access control schemes that are based on interactive and non-interactive protocols for establishing secure communication and can be designed and instantiated using the framework  ... 
doi:10.1109/ifipnetworking.2015.7145300 dblp:conf/networking/KuriharayUW15 fatcat:3k24rjkkkfdy3kmectsbdtsmce

Forward Private Searchable Symmetric Encryption with Optimized I/O Efficiency

Xiangfu Song, Changyu Dong, Dandan Yuan, Qiuliang Xu, Minghao Zhao
2018 IEEE Transactions on Dependable and Secure Computing  
However, Bost's scheme is constructed with a relatively inefficient public key cryptographic primitive, and has poor I/O performance.  ...  We then present FASTIO, which retains all good properties of FAST, and further improves I/O efficiency. We implemented the two schemes and compared their performance with Bost's scheme.  ...  ACKNOWLEDGMENT The authors would like to thank the editor and the anonymous reviewers for their help in improving the paper. This work is supported by the National Natural Science Foundation of China  ... 
doi:10.1109/tdsc.2018.2822294 fatcat:rqvdog72wbewjjqo6kpzb4mshi

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Newton Masinde, Kalman Graffi
2020 SN Computer Science  
These platforms offer services that support interactions via messaging, chatting or audio/video conferencing, and also sharing of content.  ...  data and communication traces securely.  ...  With ABE the message is encrypted using a randomly chosen symmetric encryption key, then encrypted with ABE.  ... 
doi:10.1007/s42979-020-00315-8 fatcat:iwktgohkjbdalmalaj5h3lulri
« Previous Showing results 1 — 15 out of 2,670 results