Two Party RSA Key Generation

By Niv Gilboa. 1999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

QUOTIENT: Two-Party Secure Neural Network Training and Prediction (2019, methodology): “For (ii) we use a vectorized version of the OT-based multiplication protocol presented originally in [16], and used in [11, 41].”
Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, methodology): “Let us thus first argue security of our protocols for the inner product functionality: while for the security of the OTbased protocol we refer the reader to [18, 29], we state the correctness and security of the protocol based on a Trusted Initializer in the following lemma.”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “For the sake of completenesswe include a short description of [5] as adapted by [36] for the two-party setting.”
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation (2015, methodology): “We thank Marina Blanton for sharing the Miracl-based DGK code from [10] with us (we used this code as a baseline for our GMP-based DGK implementation), Claudio Orlandi for pointing us to the OT-based multiplication protocol of [33], and all anonymous reviewers for their helpful comments.”
EduCTX: A Blockchain-Based Higher Education Credit Platform (2017, background): “A multisignature protocol is a well known concept in the public key cryptography world [42], [49].”
Privacy Preserving Data Mining (2000, background): “[3, 11 ,6]). While previous protocols were efficient (polynomial) in the size of their inputs,this property does not suffice for data mining applications,as the input consists of huge databases.”
Towards practical privacy-preserving genome-wide association study (2018, methodology): “COPE is based on Gilboa’s oblivious product evaluation [Gil99], where the parties run k sets of 1-out-of-2 OTs, on k -bit inputs.”
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody (2018, background): “This approach was introduced by [19] but suffers from selective-bit attacks.”
Function Secret Sharing: Improvements and Extensions (2016, methodology): “For instance, if there is an honest majority of parties (t < m/2) they could use a “BGW-style” protocol [4], or if there is no honest majority they could use a “GMW-style” protocol [19] or an arithmetic variant of this protocol [17, 23].”
Extending Oblivious Transfers Efficiently (2003, background): “, [30,29,17,26,12,27]), where oblivious transfers typically form the efficiency bottleneck.”
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer (2016, methodology): “Our starting point is the passively secure two-party product-sharing protocol of Gilboa [20], which uses k oblivious transfers to multiply two k -bit ﬁeld elements.”