Results 271 to 280 of about 9,161 (305)
Some of the next articles are maybe not open access.
Secure multi-party quantum computation
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker
Claude Crépeau +2 more
openaire +1 more source
Privacy in Multi-party Computation in MapReduce
2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS), 2019Progressively Cloud computing is becoming acceptable to everyone as it allows users to maintain, manage and backup their data remotely. According to recent report it has found that the numbers of cloud users are increasing day by day which provide that the cloud applications often have to handle very large amounts of data and have to process them ...
Syeda Israt Ferdaus +1 more
openaire +1 more source
Secure Multi-party Computational Geometry
2001The general secure multi-party computation problem is when multiple parties (say, Alice and Bob) each have private data (respectively, a and b) and seek to compute some function f(a, b) without revealing to each other anything unintended (i.e., anything other than what can be inferred from knowing f(a, b)). It is well known that, in theory, the general
Mikhail J. Atallah, Wenliang Du 0001
openaire +1 more source
Graceful Degradation in Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2011The goal of Multi Party Computation (MPC) is to perform an arbitrary computation in a distributed private and fault tolerant way. For this purpose a fixed set of n parties runs a protocol that tolerates an adversary corrupting a subset of the participating parties and still preserves certain security guarantees.
Hirt Martin +3 more
openaire +2 more sources
Differentially private multi-party computation
2016 Annual Conference on Information Science and Systems (CISS), 2016We study the problem of multi-party computation under approximate (e,δ) differential privacy. We assume an interactive setting with k parties, each possessing a private bit. Each party wants to compute a function defined on all the parties' bits.
Peter Kairouz +2 more
openaire +1 more source
Round-Optimal Secure Multi-Party Computation
Journal of Cryptology, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shai Halevi +3 more
openaire +2 more sources
Complexity of Multi-Party Computation Functionalities
2013The central objects of secure multiparty computation are the “multiparty functions” (or functionalities) that it seeks to securely realize. In this chapter we survey a set of results that constitute a Cryptographic Complexity Theory. This theory classifies and compares multiparty functions according to their secure computability and
Hemanta K. Maji +2 more
openaire +2 more sources
Oblivious TLS via Multi-party Computation
2021In this paper, we describe Oblivious TLS: an MPC protocol that we prove UC secure against a majority of actively corrupted parties. The protocol securely implements TLS 1.3. Thus, any party P who runs TLS can communicate securely with a set of servers running Oblivious TLS; P does not need to modify anything, or even be aware that MPC is used.
Damiano Abram +3 more
openaire +3 more sources
Multi-Party Computation in the GDPR
2022Lukas Helminger, Christian Rechberger
openaire +2 more sources
Covert Multi-Party Computation
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007Nishanth Chandran +3 more
openaire +1 more source