[PDF] Top 20 Limits of Practical Sublinear Secure Computation

... The main concrete bottleneck of current FHE schemes, which makes them slow in practice, is their computational complexity. Even in the case of PIR, which can be viewed as the simplest instance of “somewhat-homomorphic ... See full document

... in secure computation and its potential use in practice has gained much interest, and many works in the past 5 years have focused on this question with impressive ...for secure computation are ... See full document

... perfectly secure, in the sense that every operation on the ORAM data structure succeeds with probability 1 and obliviousness is guaran- teed against an unbounded ...perfectly secure single-server ORAM ... See full document

... Our rNISC/OLE protocol is information-theoretic and does not rely on any cryptographic as- sumptions. Its complexity is polynomial in the size of an arithmetic branching program being computed. This is sufficient to ... See full document

... two-party computation. In the setting of secure two-party computation, two parties with private inputs wish to jointly compute some function of their inputs while preserving certain security ... See full document

... Recent work on multi-input functional encryption [14] implies that the existence of a fully robust NIMPC protocol for general functions, with indistinguishability based security, is equivalent to indistin- guishability ... See full document

... In this section, we show the performance of scoram when used in practical applications. We assume Alice holds a sorted array and Bob holds queries. They would like to re- peatedly search for some element over the ... See full document

... provide secure two-party ...perfectly secure protocols in which the adversary simply does not have any information about the secret, the adversary in the computationally secure model is unable to ... See full document

... There have been many attempts to develop tools that support verified implementations. Many of these tools support proofs in the symbolic model of cryptography. There are some notable ex- ceptions, however. For instance, ... See full document

... for practical uses (because these protocols were constructed based on the boolean circuit or the arithmetic circuit of the functionality, and do not utilize the properties of specific ...not practical to ... See full document

... in secure compu- tation include DGHV [VDGHV10], NTRU [HPS98] and BGV ...a practical example, NTRU has been used for secure teleconferencing and e-mail filtering ... See full document

... on secure two-party computation [OS97, GKK + 11, LO13, GGH + ...for secure computation of RAM programs in the multiparty setting: An aside in the work of Damg˚ ard, Meldgaard, and Nielsen ... See full document

... Homomorphic encryption schemes can be broadly classified as fully homomorphic encryption (FHE) or partial Homomorphic encryption (PHE). Though FHE schemes are ideally, their practical viability is still a fantasy. ... See full document

... hysically freezing the memory sticks in order to retain a snapshot of transitory content – so there has historically been an incentive towards encrypted RAM. SGX: Intel’s current SGX TM (‘Software Guard eXtensions’) ... See full document

... In more details, each ITM is initialized with the security parameter κ and random coins, where the environment receives an additional auxiliary input. The protocol proceeds by a sequence of activations, where the ... See full document

... of computation of an inner product is made in [52] but we expect that the timings would be considerably worse as data encrypted using ElGamal to compute the products would have to be shipped back to the ... See full document

... focus only on the verification step, which anyway can be executed in parallel and independently of the main semi-honest protocol. Our experiments demonstrate the computational effort (measured by its running time) ... See full document

... protocols secure against passive adversaries, both in the case of two-party protocols based on Yao circuits [19] and that of many-party protocols, based on secret sharing techniques [5, 10, ...for practical ... See full document

... The message complexity of MPC protocols has been explicitly con- sidered in several previous works, but the model of MPC considered in these works is quite different from ours. In particular, the message com- plexity in ... See full document

... We propose a compressive sensing based privacy preserving watermark detection framework that involves secure multiparty computation and the cloud. There are three parties in the proposed framework, the data ... See full document