Zaphod

Aly, Abdelrahaman; Orsini, Emmanuela; Rotaru, Dragos; Smart, Nigel P.; Wood, Tim

doi:10.1145/3338469.3358943

Cited by 25 publications

(41 citation statements)

References 27 publications

(68 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their protocols run in logarithmic number of rounds, in the bit-length of the values to be compared, but also with logarithmic communication cost (instead of the usually linear communication cost). The efficiency of these protocols comes also at the cost of statistical, instead of unconditional security and have been adopted and implemented in a number of MPC platforms (e.g., [13,1]). Our comparison protocol, in combination with the recent advances in the generation of daBits [25], and edaBits [14] performs concretely better than the one of Catrina and de Hoogh [6], while offering unconditional (instead of statistical) security in Z 2 k .…”

Section: Protocol Communication Computation Rounds Security Adversary...mentioning

confidence: 99%

“…After years of active research, both in theoretical results and system building, multiparty computation (MPC) is becoming practical as a paradigm. Recent research results and practical implementations [13,1], deployment of MPC in real-life applications [3], as well as organizations beyond academia offering commercial MPC solutions [30,27,26], confirm that MPC is reaching maturity. However, MPC, just like any other cryptographic primitive deployed to enhance privacy, comes at a significant efficiency penalty, in terms of computation and communication.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

$$\mathsf {Rabbit}$$: Efficient Comparison for Secure Multi-Party Computation

Makri

Rotaru

Vercauteren

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Secure comparison has been a fundamental challenge in privacypreserving computation, since its inception as Yao's millionaires' problem (FOCS 1982). In this work, we present a novel construction for general nparty private comparison, secure against an active adversary, in the dishonest majority setting. For the case of comparisons over fields, our protocol is more efficient than the best prior work (edaBits: Crypto 2020), with "1.5ˆbetter throughput in most adversarial settings, over 2.3ˆbetter throughput in particular in the passive, honest majority setting, and lower communication. Our comparisons crucially eliminate the need for bounded inputs as well as the need for statistical security that prior works require. An important consequence of removing this "slack" (a gap between the bit-length of the input and the MPC representation) is that multi-party computation (MPC) protocols can be run in a field of smaller size, reducing the overhead incurred by privacy-preserving computations. We achieve this novel construction using the commutative nature of addition over rings and fields. This makes the protocol both simple to implement and highly efficient and we provide an implementation in MP-SPDZ (CCS 2020).

show abstract

Section: Protocol Communication Computation Rounds Security Adversary...mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

$$\mathsf {Rabbit}$$: Efficient Comparison for Secure Multi-Party Computation

Makri

Rotaru

Vercauteren

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Yao's technique was extended later [26] to multi-party computation. Over the past years, many improvements have been developed to enhance the efficiency of garbled circuits [27,28]. Despite these improvements, garbled circuits are still impractical solutions for multi-party computations.…”

Section: Secure Multi-party Computationmentioning

confidence: 99%

Privacy Preserving Scheme for Document Similarity Detection

2021

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

The problem of detecting similar documents plays an essential role for many real-world applications, such as copyright protection and plagiarism detection. To protect data privacy, the new version of such a problem becomes more challenging, where the matched documents are distributed among two or more parties and their privacy should be preserved. In this paper, we propose new privacy-preserving document similarity detection schemes by utilizing the locality-sensitive hashing technique, which can handle the misspelled mistakes. Furthermore, the keywords' occurrences of a given document are integrated into its underlying representation to support a better ranking for the returned results.We introduced a new security definition, which hides the exact similarity scores towards the querying party. Extensive experiments on real-world data illustrate that our proposed schemes are efficient and accurate.

show abstract

“…Both approaches require the desired functionality to be expressed as a boolean circuit, and the output is computed gate by gate. Practical implementations of SMC include the SCALE-MAMBA system [4], as well as the ObliVM framework [29], which allows programs to be written in a (restricted) high-level syntax that can then be compiled to a circuit. Outsourcing computation using SMC is usually done using a distributed protocol involving a cluster of several servers [8].…”

Section: Secure Multiparty Computation (Smc)mentioning

confidence: 99%

Efficient Oblivious Database Joins

Krastnikov,

Kerschbaum,

Stebila

2020

Preprint

View full text Add to dashboard Cite

A major algorithmic challenge in designing applications intended for secure remote execution is ensuring that they are oblivious to their inputs, in the sense that their memory access patterns do not leak sensitive information to the server. This problem is particularly relevant to cloud databases that wish to allow queries over the client's encrypted data. One of the major obstacles to such a goal is the join operator, which is non-trivial to implement obliviously without resorting to generic but inefficient solutions like Oblivious RAM (ORAM).We present an oblivious algorithm for equi-joins which (up to a logarithmic factor) matches the optimal O(n log n) complexity of the standard non-secure sort-merge join (on inputs producing O(n) outputs). We do not use use expensive primitives like ORAM or rely on unrealistic hardware or security assumptions. Our approach, which is based on sorting networks and novel provably-oblivious constructions, is conceptually simple, easily verifiable, and very efficient in practice. Its data-independent algorithmic structure makes it secure in various different settings for remote computation, even in those that are known to be vulnerable to certain side-channel attacks (such as Intel SGX) or with strict requirements for low circuit complexity (like secure multiparty computation). We confirm that our approach is easily realizable through a compact prototype implementation which matches our expectations for performance and is shown, both formally and empirically, to possess the desired security characteristics.

show abstract

Zaphod

Cited by 25 publications

References 27 publications

$$\mathsf {Rabbit}$$: Efficient Comparison for Secure Multi-Party Computation

$$\mathsf {Rabbit}$$: Efficient Comparison for Secure Multi-Party Computation

Privacy Preserving Scheme for Document Similarity Detection

Efficient Oblivious Database Joins

Contact Info

Product

Resources

About