A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Filters
Optimizing Transport Layer for Secure Computation
[article]
2019
IACR Cryptology ePrint Archive
As a highlight, even a general purpose transport layer protocol, such as SABUL, improves the run-time of 2PC over TCP on EU-Australia connection for circuits with > 10 6 Boolean gates by a factor of 8. ...
Although significantly improved, the performance of 2PC is still prohibitive for practical systems. ...
Though our work only considers Boolean circuits, we note that a framework for mixed protocol was implemented in ABY [17] : this framework combines arithmetic sharing, boolean sharing and garbled circuits ...
dblp:journals/iacr/BrandtOSS19
fatcat:nq7jolswjffnlb72gx4ixylxbq
Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference
[article]
2022
IACR Cryptology ePrint Archive
Secure two-party neural network inference (2PC-NN) can offer privacy protection for both the client and the server and is a promising technique in the machine-learning-as-a-service setting. ...
The main contributions of Cheetah are two-fold: the first part includes carefully designed homomorphic encryption-based protocols that can evaluate the linear layers (namely convolution, batch normalization ...
The authors would like to thank the anonymous reviewers for their insightful comments and Dr. Marina Blanton for the shepherding. ...
dblp:journals/iacr/HuangLHD22
fatcat:mtnyubbd7vggrd35powjppbb2u
How to Efficiently Evaluate RAM Programs with Malicious Security
[chapter]
2015
Lecture Notes in Computer Science
Our RAM protocols achieve ratios matching the state of the art for circuit-based 2PC. ...
program. sequence of ORAM instructions using traditional circuit-based 2PC phases. ...
, LP11, sS11, sS13, Lin13, HKE13, MR13] , based on GMW [NNOB12] , and based on arithmetic circuits [DPSZ12] . ...
doi:10.1007/978-3-662-46800-5_27
fatcat:2syqr44de5ep7h2a2sjljsdsty
MOTIF: (Almost) Free Branching in GMW via Vector-Scalar Multiplication
[article]
2020
IACR Cryptology ePrint Archive
For 2PC and a circuit with 16 branches, each comparing two length-65000 bitstrings, MOTIF outperforms standard GMW in terms of communication by ≈ 9.4×. ...
The Goldreich-Micali-Wigderson, or GMW, protocol is a foundational circuit-based technique that realizes MPC for p players and is secure against up to p − 1 semi-honest corruptions. ...
Arithmetic MPC and Vector OLE. A number of works presented arithmetic generalizations of MPC in the GMW style, e.g. [IPS09, ADI + 17]. ...
dblp:journals/iacr/HeathKP20
fatcat:fcrjp6jccnctvgpe36prfv4qaa
Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path
[article]
2020
IACR Cryptology ePrint Archive
In terms of wall-clock time for circuits with branching factor 16 over a 50 Mbps WAN on a laptop, Stack outperforms state-ofthe-art half-gates-based 2PC by more than 4×. encrypted gates as material (following ...
Unlike these works, ours is for general 2PC where no player knows which conditional branch is taken. ...
We construct a practically efficient stacked garbling scheme Stack, which improves communication for circuits with conditional branching. ...
dblp:journals/iacr/HeathK20a
fatcat:4rkxtq5ihvdyvok2rmpdz3xjga
Gazelle: A Low Latency Framework for Secure Neural Network Inference
[article]
2018
arXiv
pre-print
(such as garbled circuits). ...
The growing popularity of cloud-based machine learning raises a natural question about the privacy guarantees that can be provided in such a setting. ...
We thank Shafi Goldwasser, Rina Shainski and Alon Kaufman for delightful discussions. We thank our sponsors, the Qualcomm Innovation Fellowship and Delta Electronics for supporting this work. ...
arXiv:1801.05507v1
fatcat:sbo4nsu3ufbahfmfmeegqter2a
., during the financial crisis of 2008 -and it can be quantified based on the dependencies between financial institutions; however, the necessary data is highly sensitive and cannot be safely disclosed ...
We are grateful to Aseem Rastogi, Matthew Hammer, and Michael Hicks for their extensive support in using the Wysteria circuit compiler and MPC implementation. ...
Acknowledgments We thank our shepherd, Raluca Popa, and the anonymous reviewers for their thoughtful comments and suggestions. ...
doi:10.1145/3064176.3064218
dblp:conf/eurosys/PapadimitriouNH17
fatcat:kzuxhjhvpjaulbxbt73jvf5lca
Practical Secure Computation for Internet Infrastructure
2021
Although the theoretical foundations for the two-party variant, secure two-party computation (2PC), were introduced in the 1980s, MPC has not yet seen widespread deployment in spite of its benefits. ...
Secure multi-party computation (MPC) is a cryptographic tool for privacy-preserving computation. ...
There are two main types of constructions that are considered in this thesis: Yao's garbled circuits for 2PC in § 2.3.1 and secret sharing for MPC in § 2.3.2.
2PC Based on Garbled Circuits In Yao's garbled ...
doi:10.26083/tuprints-00018504
fatcat:or564dd4ffhb7ndhuk5w6xpetm
Privacy-Preserving Blockchain-Based Nonlinear SVM Classifier Training for Social Networks
2020
Security and Communication Networks
The SVM classifier, as one of the most prevailing machine learning techniques for classification, is a crucial tool for social data analysis. ...
In this paper, we propose a novel privacy-preserving nonlinear SVM classifier training scheme based on blockchain. ...
For instance, many e-commerce companies may collect social information about potential customers and train effective SVM classifiers to conduct commodity recommendation. ...
doi:10.1155/2020/8872853
fatcat:afdb5s73fnd2tbpnzvu6k4r4ym
CrypTFlow2: Practical 2-Party Secure Inference
[article]
2020
pre-print
At the core of CrypTFlow2, we have new 2PC protocols for secure comparison and division, designed carefully to balance round and communication complexity for secure inference tasks. ...
We present CrypTFlow2, a cryptographic framework for secure inference over realistic Deep Neural Networks (DNNs) using secure 2-party computation. ...
In contrast, many prior works on 2PC [49, 51] and 3PC [45, 50, 62] used a local truncation method for approximate truncation based on a result from [51] . ...
doi:10.1145/3372297.3417274
arXiv:2010.06457v1
fatcat:peh5mgnbajawtiqsihkq4vyqc4
Privacy-preserving training of tree ensembles over continuous data
2022
Proceedings on Privacy Enhancing Technologies
In this paper we propose three more efficient alternatives for secure training of decision tree based models on data with continuous features, namely: (1) secure discretization of the data, followed by ...
The standard "in the clear" algorithm to grow decision trees on data with continuous values requires sorting of training examples for each feature in the quest for an optimal cut-point in the range of ...
The authors would like to thank Microsoft for the donation of cloud computing credits through the UW Azure Cloud Computing Credits for Research program. ...
doi:10.2478/popets-2022-0042
fatcat:kty7klf4inhfznn7cvaychmn6e
Secure and Robust Machine Learning for Healthcare: A Survey
[article]
2020
arXiv
pre-print
Finally, we provide insight into the current research challenges and promising directions for future research. ...
In addition, we present potential methods to ensure secure and privacy-preserving ML for healthcare applications. ...
Authors
Goal
Method
ML Model(s)
Medical Dataset(s)
David et al. [109]
Privacy
Commodity based cryptography.
Hyperplane decision
and Naive Bayes classifiers. ...
arXiv:2001.08103v1
fatcat:u6obszbeajcp5asciz5z5unmlq
Blind Certificate Authorities
2019
2019 IEEE Symposium on Security and Privacy (SP)
We construct an efficient SCI protocol for communications delivered over TLS, and use it to realize anonymous proofs of account ownership for SMTP servers. ...
The size of a ZKBoo proof for a given computation is only decided by the number of AND/ADD gates in the corresponding arithmetic circuit. ...
Malicious secure 2PC. ...
doi:10.1109/sp.2019.00007
dblp:conf/sp/WangAPRS19
fatcat:3gctspju7fdmnkhdvojugzm5va
Group Structure in Correlations and Its Applications in Cryptography
2021
The new applications include a completeness result for black box group computation, perfectly secure protocols for evaluating a broad class of black box "mixed-groups" circuits with bi-affine homomorphisms ...
Acknowledgements We thank Yuval Ishai and various anonymous reviewers for helpful comments and pointers. ...
Commodity-based 2pc for arithmetic circuits. In IMA International Conference on Cryptography and Coding, pages 154-177. ...
doi:10.4230/lipics.itc.2021.1
fatcat:qn56i6pb4zg2pm4gcivvsktsuu
DBKDA 2011 Editors
unpublished
a series of international events covering a large spectrum of topics related to advances in fundamentals on databases, evolution of relation between databases and other domains, data base technologies ...
We are grateful to the members of the DBKDA 2011 organizing committee for their help in handling the logistics and for their work to make this professional meeting a success. ...
How they package their knowledge as commodity? In this article, we discuss how the knowledge as commodity and mediate various communities in knowledge markets. ...
fatcat:7j4mo3iqtvgmro7i3d5pfb4ycu
« Previous
Showing results 1 — 15 out of 16 results