English
Related papers

Related papers: Bootstrapped Oblivious Transfer and Secure Two-Par…

200 papers

In the classical multi-party computation setting, multiple parties jointly compute a function without revealing their own input data. We consider a variant of this problem, where the input data can be shared for machine learning training…

Machine Learning · Computer Science 2020-09-25 Chenwei Wu , Chenzhuang Du , Yang Yuan

Oblivious RAM (ORAM) protocols are powerful techniques that hide a client's data as well as access patterns from untrusted service providers. We present an oblivious cloud storage system, ObliviSync, that specifically targets one of the…

Cryptography and Security · Computer Science 2016-12-05 Adam J. Aviv , Seung Geol Choi , Travis Mayberry , Daniel S. Roche

One-sided output secure function evaluation is a cryptographic primitive where the two mutually distrustful players, Alice and Bob, both have a private input to a bivariate function. Bob obtains the value of the function for the given…

Quantum Physics · Physics 2025-02-10 Esther Hänggi , Severin Winkler

We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries. Our protocols are in the common random string (CRS) model. -…

Quantum Physics · Physics 2021-08-17 James Bartusek , Andrea Coladangelo , Dakshita Khurana , Fermi Ma

Known protocols for secure delegation of quantum computations from a client to a server in an information theoretic setting require quantum communication. In this work, we investigate methods to reduce communication overhead. First, we…

Quantum Physics · Physics 2025-04-25 Abbas Poshtvan , Oleksandra Lapiha , Mina Doosti , Dominik Leichtle , Luka Music , Elham Kashefi

This paper proposes an algorithm for oblivious transfer using elliptic curves. Also, we present its application to chosen one-out-of-two oblivious transfer.

Cryptography and Security · Computer Science 2007-06-13 Abhishek Parakh

We introduce a new setting for two-party cryptography with temporarily trusted third parties. In addition to Alice and Bob in this setting, there are additional third parties, which Alice and Bob both trust to be honest during the protocol.…

Quantum Physics · Physics 2020-09-25 Norbert Lütkenhaus , Ashutosh S Marwah , Dave Touchette

Today, we are in the era of big data, and data are becoming more and more important, especially private data. Secure Multi-party Computation (SMPC) technology enables parties to perform computing tasks without revealing original data.…

Cryptography and Security · Computer Science 2023-03-02 Yuanqing Feng , Tao Bai , Songfeng Lu , Xueming Tang , Junjun Wu

Machine Learning models require a vast amount of data for accurate training. In reality, most data is scattered across different organizations and cannot be easily integrated under many legal and practical constraints. Federated Transfer…

Cryptography and Security · Computer Science 2019-10-31 Shreya Sharma , Xing Chaoping , Yang Liu , Yan Kang

Logistic regression is an algorithm widely used for binary classification in various real-world applications such as fraud detection, medical diagnosis, and recommendation systems. However, training a logistic regression model with data…

Cryptography and Security · Computer Science 2023-09-19 Jing Liu , Jamie Cui , Cen Chen

We study the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users. We show that such privacy-preserving data access is possible using a combination of probabilistic…

Cryptography and Security · Computer Science 2011-05-23 Michael T. Goodrich , Michael Mitzenmacher , Olga Ohrimenko , Roberto Tamassia

Secure sum computation of private data inputs is an interesting example of Secure Multiparty Computation (SMC) which has attracted many researchers to devise secure protocols with lower probability of data leakage. In this paper, we provide…

Cryptography and Security · Computer Science 2010-03-23 Rashid Sheikh , Beerendra Kumar , Durgesh Kumar Mishra

In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably…

Information Theory · Computer Science 2018-06-12 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi

We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general "compiler" improving the security of such protocols: if the original protocol is secure…

Quantum Physics · Physics 2009-08-31 Ivan Damgaard , Serge Fehr , Carolin Lunemann , Louis Salvail , Christian Schaffner

The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the same compositionality guarantees. We prove that in this model…

Quantum Physics · Physics 2018-02-13 Dominique Unruh

Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…

Quantum Physics · Physics 2016-08-31 André Chailloux , Gus Gutoski , Jamie Sikora

The main conceptual contribution of this paper is investigating quantum multiparty communication complexity in the setting where communication is \emph{oblivious}. This requirement, which to our knowledge is satisfied by all quantum…

Quantum Physics · Physics 2023-12-29 François Le Gall , Daiki Suruga

In this work, we study how to securely evaluate the value of trading data without requiring a trusted third party. We focus on the important machine learning task of classification. This leads us to propose a provably secure four-round…

Cryptography and Security · Computer Science 2019-01-04 Vanishree Rao , Yunhui Long , Hoda Eldardiry , Shantanu Rane , Ryan Rossi , Frank Torres

We propose a novel system for optical encryption based on an optical XOR and optical Linear Feedback Shift Register (oLFSRs). Though we choose LFSR for its ability to process optical signals at line rate, we consider the fact that it offers…

Cryptography and Security · Computer Science 2016-10-06 Anna Engelmann , Admela Jukan

Elaborate protocols in Secure Multi-party Computation enable several participants to compute a public function of their own private inputs while ensuring that no undesired information leaks about the private inputs, and without resorting to…

Cryptography and Security · Computer Science 2019-01-04 Patrick Ah-Fat , Michael Huth