Results 221 to 230 of about 3,214 (260)

A Post-Quantum Authentication and Key Agreement Protocol Based on Lattice-Based KEM for Secure Network Environments. [PDF]

Entropy (Basel)
Chen X, Wu W, Liang G, Tan H, Yu Y.
europepmc   +1 more source

A secure and scalable blockchain-assisted authentication framework for decentralized IoT data management. [PDF]

Sci Rep
Iswarya G, Vennila C.
europepmc   +1 more source

Privacy and security enhancement in smart cities using advanced cryptographic techniques. [PDF]

Sci Rep
More KD, Pramod D.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Secure Multi-party Computation and Its Applications

Communications in Computer and Information Science, 2022
There is an urgent need for secure data sharing solutions, such that different organisations can jointly compute with their data, without revealing sensitive data to each other. Secure multi-party computation is an innovative cryptographic technology that has recently become more mature, such that it can be used to obtain very secure data sharing ...
Thijs Veugen
exaly   +3 more sources

Secure Multi-Party Computation

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018
Secure multi-party computation (SMC) is an emerging topic which has been drawing growing attention during recent decades. There are many examples which show importance of SMC constructions in practice, such as privacy-preserving decision making and machine learning, auctions, private set intersection, and others.
Fattaneh Bayatbabolghani, Marina Blanton
openaire   +1 more source

Adaptively secure multi-party computation

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96, 1996
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries (i.e., adversaries that may choose the corrupted parties during the course of the computation), in a setting where the channels are insecure and secure communication is achieved by cryptographic primitives based on computational limitations of the ...
Ran Canetti, Uriel Feige, Oded Goldreich 0001, Moni Naor   +3 more
openaire   +1 more source

Secure multi-party quantum computation

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002
Secure 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, Daniel Gottesman, Adam D. Smith 0001   +2 more
openaire   +1 more source

Round-Optimal Secure Multi-Party Computation

Journal of Cryptology, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam   +3 more
openaire   +2 more sources

Secure Multi-party Computational Geometry

2001
The 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

Secure Multi-Party Computation on Blockchain: An Overview

2020
Secure multi-party computation (SMPC) is a hot topic in the field of cryptography. It focuses on finishing computation tasks without revealing users’ inputs and outputs in decentralized scenarios. Although many researches have been conducted to perform SMPC protocols, it is hard to obtain fairness while most participants in SMPC are dishonest. Recently,
Hanrui Zhong, Yingpeng Sang, Yongchun Zhang, Zhicheng Xi   +3 more
openaire   +1 more source