30 Hits in 5.6 sec

3PC ORAM with Low Latency, Low Bandwidth, and Fast Batch Retrieval [chapter]

Stanislaw Jarecki, Boyang Wei
2018 Lecture Notes in Computer Science  
Multi-Party Computation of Oblivious RAM (MPC ORAM) implements secret-shared random access memory in a way that protects access pattern privacy against a threshold of corruptions.  ...  Standard MPC techniques can implement the hashing step, but the retrieval of the hash page is a random access to a large memory.  ...  Revisiting square-root oram efficient random access in multi-party computation. In Proceedings of the 37th IEEE Symposium on Security and Privacy (Oakland), IEEE '16, 2016.  ... 
doi:10.1007/978-3-319-93387-0_19 fatcat:siegnajrnradvkdalrpqoqn5py

Secure Stable Matching at Scale

Jack Doerner, David Evans, abhi shelat
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Secure multi-party computation offers the possibility of private matching processes that do not rely on any common trusted third party.  ...  However, stable matching algorithms have previously been considered infeasible for execution in a secure multi-party context on non-trivial inputs because they are computationally intensive and involve  ...  Acknowledgments The authors thank Samee Zahur for insightful conversations about this work and assistance with Obliv-C and ORAM, and Elaine Shi for constructive comments and advice.  ... 
doi:10.1145/2976749.2978373 dblp:conf/ccs/DoernerES16 fatcat:4wgv35kgwrhg5ob6ognyarchf4

Toward Practical Secure Stable Matching

M. Sadegh Riazi, Ebrahim M. Songhori, Ahmad-Reza Sadeghi, Thomas Schneider, Farinaz Koushanfar
2017 Proceedings on Privacy Enhancing Technologies  
We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm.  ...  We achieve this by introducing a compact and efficient sub-linear size circuit.  ...  A very recent paper [41] revisits Square-Root ORAM, an alternative ORAM structure that has lower initialization cost than Circuit ORAM.  ... 
doi:10.1515/popets-2017-0005 dblp:journals/popets/RiaziSSSK17 fatcat:pozg2erk4jblvkbezsoaxbuvri

Outsourced private information retrieval

Yizhou Huang, Ian Goldberg
2013 Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society - WPES '13  
This extends the usual ORAM model by allowing multiple database readers without requiring trusted hardware; indeed, almost all of the computation in our scheme during reads is performed by untrusted cloud  ...  Our system is compatible with existing PIR access control and pricing schemes on a per-record basis for these reads.  ...  They gave two constructions for ORAM, a Square Root Solution and a Hierarchy Solution, achieving for each ORAM access amortized costs of Θ( √ n · log 2 n) and Θ(log 3 T ) respectively [12] .  ... 
doi:10.1145/2517840.2517854 dblp:conf/wpes/HuangG13 fatcat:4733eodivferfder4tdjmfpxmm

Secure and Scalable Document Similarity on Distributed Databases: Differential Privacy to the Rescue

Phillipp Schoppmann, Lennart Vogelsang, Adrià Gascón, Borja Balle
2020 Proceedings on Privacy Enhancing Technologies  
Secure Multi-Party Computation (MPC) offers a robust cryptographic approach to this problem, and in fact several protocols have been proposed for various data analysis and machine learning tasks.  ...  In this work, we focus on secure similarity computation between text documents, and the application to k-nearest neighbors (k-NN) classification.  ...  Server and Client icons in Figure 4 are from Server icon designed by Smashicons, Client icon designed by Freepik.  ... 
doi:10.2478/popets-2020-0024 fatcat:iujlglrmivg6vb4crgdjugenbu

Survey on Secure Search Over Encrypted Data on the Cloud [article]

Hoang Pham, Jason Woodworth, Mohsen Amini Salehi
2018 arXiv   pre-print
Cloud computing has become a potential resource for businesses and individuals to outsource their data to remote but highly accessible servers.  ...  In addition, although these techniques enable different search types and vary in details, they share similarities in their components and architectures.  ...  Nonetheless, it induces a square root complexity overhead in the set up phase.  ... 
arXiv:1811.09767v1 fatcat:scgxzjjnvfbbbnh7wxpr6eu5ci

Visor: Privacy-Preserving Video Analytics as a Cloud Service [article]

Rishabh Poddar and Ganesh Ananthanarayanan and Srinath Setty and Stavros Volos and Raluca Ada Popa
2020 arXiv   pre-print
It protects the pipeline against side-channel attacks induced by data-dependent access patterns of video modules, and also addresses leakage in the CPU-GPU communication channel.  ...  A key concern in such services is privacy of the videos being analyzed.  ...  This work was supported in part by the NSF CISE Expeditions Award CCF-1730628, and gifts from the Sloan Foundation, Bakar Program, Alibaba, Amazon Web Services, Ant Financial, Capital One, Ericsson, Facebook  ... 
arXiv:2006.09628v2 fatcat:ipifnn7tuberjimmgss6azglte


Tarik Moataz, Frédéric Cuppens, Nora Boulahia, Cuppens Wang, Haonan Mcconnell
2017 unpublished
Researchers therefore got interested in the following question: how to search on outsourced en-crypted data while preserving efficient communication, computation and storage overhead?  ...  in ORAM which is a required feature for cloud storage elasticity. iii ACKNOWLEDGEMENTS First and foremost, this thesis is dedicated to my beloved family.  ...  Multi-Party computation Multi-party computation (MPC) [25, 52, 53, 54, 69, 93, 94, 100] is one of the most powerful and general cryptographic primitives that can compute a function f securely.  ... 

Secure Computation Protocols for Privacy-Preserving Machine Learning [article]

Phillipp Schoppmann, Humboldt-Universität Zu Berlin
Multi-Party-Computation (MPC)-Protokolle stellen eine Lösung dieses Dilemmas in Aussicht, indem sie es mehreren Parteien erlauben, ML-Modelle auf der Gesamtheit ihrer Daten zu trainieren, ohne die Eingabedaten  ...  Secure multi-party computation (MPC) protocols promise a solution to this dilemma, allowing multiple parties to train ML models on their joint datasets while provably preserving the confidentiality of  ...  In practice (Section 4.7), we switch between linear scans, square-root ORAM [Zah+16] , and FLORAM [DS17] , depending on the level of the tree we are accessing.  ... 
doi:10.18452/23336 fatcat:z2al43urjbcyrlsw2txeleuqde

Internet-based relationship quality: a model for Jordanian business-to-business context

Muhammed Alnsour, Albalqa Applied University (Jordan)
2018 Marketing and Management of Innovations  
This research finds that online banking has a positive impact on Relationship Quality (RQ) in a business-to-business context in Jordan.  ...  Qualitative data were gathered through in-depth interviews to achieve the goal of refining the initial research model.  ...  Discriminate validity is shown for each variable by inspection of the square root of AVE [√AVE] in Table 3 .  ... 
doi:10.21272/mmi.2018.4-15 fatcat:2qgbkdwafrg3zfeax5zkufmica

Peer-to-Peer Information Retrieval

Almer S. Tigelaar, Djoerd Hiemstra, Dolf Trieschnigg
2012 ACM Transactions on Information Systems  
We showed various optimisations that can be applied in peer-to-peer information retrieval networks to reduce bandwidth usage and latency and to improve the quality and quantity of the search results returned  ...  What is good can be defined in many ways: efficient, budget balanced, et cetera. A mechanism may have a centre: a central party that makes decisions.  ...  efficiency and communication efficiency.  ... 
doi:10.1145/2180868.2180871 fatcat:6kgocz6zffey7ja6fnj7ju7n6m

Practical Private Set Intersection Protocols for Privacy-Preserving Applications

Christian Weinert
Private set intersection (PSI) protocols are cryptographic protocols that allow two parties to securely compute the intersection of their private input sets without disclosing elements outside of the intersection  ...  To instead perform the matching procedure between address books and user databases in a privacy-preserving manner, we develop and optimize two PSI protocols that are significantly more efficient than the  ...  Computation ORAM Oblivious Random Access Machine OPRF Oblivious Pseudo-Random Function OPPRF Oblivious Programmable Pseudo-Random Function OT Oblivious Transfer PII Personally Identifiable Information  ... 
doi:10.26083/tuprints-00019295 fatcat:mcrri3mvh5a3jois3hzpolx3ae

Whole Issue

Lorraine Kerslake
2019 Ecozon@  
Such system was installed by colonial capitalism in the 1500s and turned natural resources into commodities to integrate them within the global market.  ...  1 We draw on Gómez-Barris (2017) 's definition of "extractive zones" as those marked by "the colonial paradigm, worldview, and technologies that mark out regions of ‛high biodiversityʼ in order to reduce  ...  the reader or hearer in a multi-faceted meditation upon the desert.  ... 
doi:10.37536/ecozona.2019.10.1.3089 fatcat:touihuksrnc4nk3hfjrxdqiq74

Practical yet Provably Secure: Complex Database Query Execution over Encrypted Data

Florian Hahn
In this work novel encryption schemes supporting different database query types are presented enabling complex database queries over encrypted data.  ...  For specific constructions enabling exact keyword queries, range queries, database joins and substring queries over encrypted data we prove security in a formal framework, present a theoretical runtime  ...  be accessed more efficiently.  ... 
doi:10.5445/ir/1000091007 fatcat:ypncwftvqrfpvjls7zjtwhq2di

Efficient Private Function Evaluation

Ágnes Kiss
Private function evaluation (PFE) allows two or more parties to jointly compute a private function of one of the parties on the private inputs of the other parties securely.  ...  PFE can provide a viable solution in a scenario where a server holding a function that is his intellectual property or trade secret would like to compute this function on a client's sensitive input, in  ...  We thank Michael Zohner and Daniel Demmler for helping with the implementation in ABY, and the anonymous reviewers of Eurocrypt 2016 for their helpful comments on our paper. Acknowledgements.  ... 
doi:10.26083/tuprints-00017496 fatcat:nvvgirlijzg6venax5znicrkeq
« Previous Showing results 1 — 15 out of 30 results