Proceedings ArticleDOI
Bureaucratic protocols for secure two-party sorting, selection, and permuting
Guan Wang,Tongbo Luo,Michael T. Goodrich,Wenliang Du,Zutao Zhu +4 more
- pp 226-237
Reads0
Chats0
TLDR
This paper introduces a framework for secure two-party (S2P) computations, which is called bureaucratic computing, and demonstrates its efficiency by designing practical S2P computations for sorting, selection, and random permutation.Abstract:
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P computations for sorting, selection, and random permutation. In a nutshell, the main idea behind bureaucratic computing is to design data-oblivious algorithms that push all knowledge and influence of input values down to small black-box circuits, which are simulated using Yao's garbled paradigm. The practical benefit of this approach is that it maintains the zero-knowledge features of secure two-party computations while avoiding the significant computational overheads that come from trying to apply Yao's garbled paradigm to anything other than simple two-input functions.read more
Citations
More filters
Proceedings ArticleDOI
Privacy-preserving matrix factorization
TL;DR: This work shows that a recommender can profile items without ever learning the ratings users provide, or even which items they have rated, by designing a system that performs matrix factorization, a popular method used in a variety of modern recommendation systems, through a cryptographic technique known as garbled circuits.
Proceedings ArticleDOI
Privacy-preserving group data access via stateless oblivious RAM simulation
TL;DR: In this paper, the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users was studied, and a method with O(log n) amortized access overhead for simulating a RAM algorithm that has a memory of size n, using a scheme that is data oblivious with very high probability.
Book ChapterDOI
Practically efficient multi-party sorting protocols from comparison sort algorithms
TL;DR: This work proposes a simple and general approach of converting non-data-oblivious comparison sort algorithms, which include the above algorithms, into corresponding MPC protocols, and constructs an MPC sorting protocol from the well known efficient sorting algorithm, quicksort.
Proceedings Article
Secure Multi-Party Sorting and Applications
TL;DR: This thesis discusses the Spotify protocol and measurements on its performance, and contains a result on a new type of attack, using an old history detection vulnerability to time the execution of a redirect of a victim’s browser.
Book ChapterDOI
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
TL;DR: This work revisits the problem of general-purpose private function evaluation (PFE) and reduces the task of hiding the circuit topology to oblivious evaluation of a mapping that encodes the topology of the circuit, which is a generalization of the permutation mapping.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.