A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Multiparty Probability Computation and Verification
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
A multiparty computation protocol is described in which the parties can generate different probability events that is based on the sharing of a single anonymized random number, and also perform oblivious ...
Then we present a general verification procedure for multiparty probability events that involves oblivious transfer. ...
A multiparty computation protocol is described in which the parties can generate different probability events, which is achieved by sharing a single anonymized random number. ...
arXiv:1505.05081v2
fatcat:yuwo3vbmknbipfdsvt3ievkat4
Quantum digital signature scheme
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
While classical methods provide computational security only, quantum mechanics guarantees information-theoretically secure and standard digital signature schemes. ...
We demonstrate here a standard quantum digital signature scheme by replacing quantum one-way functions with multiparty controlled EPR channels. ...
Acknowledgments We acknowledge the support from the Australian Research Council (ARC) through an ARC Discovery Project (DP130102956) and an ARC Professorial Future Fellowship project (FT130100778). ...
arXiv:1507.03581v2
fatcat:wrcjfgbyobe4blfenthwmsuy6i
Practical Undeniable Multiparty Drawing-Straw Protocol in Asynchronous Networks for Resource-Constrained Information Systems
2022
Security and Communication Networks
Preserved Fulltext
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.
The next generation of mobile networks and communications (5G networks) has a very strong ability to compute, store, and so on. ...
For example, how to conduct fair and orderly multiparty communication in an intelligent transportation system (ITS). ...
U21A20465, 61922045, and U1836115), and the key projects of Guangxi Natural Science Foundation (no. 2018GXNSFDA281040). ...
doi:10.1155/2022/6841428
fatcat:pxr4mw5yjffqjh636xcenzjggy
Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
2011
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
As an application of this VSS scheme we present very efficient unconditionally secure protocols for performing multiplication of shares based on pre-distributed data which generalize two-party computations ...
The main results of this paper are a noninteractive VSS, a simplified multiplication protocol for shared values based on pre-distributed random products, and non-interactive zero knowledge proofs for arbitrary ...
Secure Multiparty Computations It is known that secure multiplication and addition of shares implies secure multiparty computation [3, [17] [18] [19] 32] . ...
doi:10.1587/transfun.e94.a.725
fatcat:ivbfasxkqzg57fyhd7crwjzwvq
Quantum-classical complexity-security tradeoff in secure multiparty computations
2000
Physical Review A. Atomic, Molecular, and Optical Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Moreover, the security of this scheme follows directly from the theory of quantum error correcting code, and hence is valid without any computational assumption. ...
I also discuss the quantum-classical complexity-security tradeoff in secure multi-party computation schemes and argue why a full-blown quantum code is necessary in my scheme. ...
Consequently, the probability that cheating player i will pass the quantum verification test in step ͑5͒ cannot exceed the probability of passing a classical random parity verification test in which player ...
doi:10.1103/physreva.61.032308
fatcat:yagbyjhbgnb4rbywhy6vanef54
A private set intersection protocol based on multi-party quantum computation for greatest common divisor
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The protocol is mainly inspired by the recent quantum private set union protocol based on least common multiple by Li, Yang, and Liu. ...
Performance analysis guarantees the correctness and it also shows that the proposed protocols are completely secure in semi-honest model. ...
The key idea of the quantum multiparty private set union proposed by Li, Yang, and Liu consists of three main steps: encoding procedure, an improved quantum multiparty computation for LCM, and decoding ...
arXiv:2303.17196v2
fatcat:yh3vpak7ybfmvc3boxkfcat5si
Secure Multiparty Computation of DNF
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Homomorphism based multiparty computation techniques are studied in this paper as they have several advantages over the other multiparty computation schemes. ...
A new homomorphism based multiparty computation technique is proposed to evaluate functions in DNF form. ...
multiparty computation. ...
doi:10.1007/978-3-540-77048-0_20
fatcat:f46yc3fljbex3gvwwtoa7k6rbq
Secure multiparty quantum computation with few qubits
2020
Physical Review A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dirkse for useful discussions and K. Chakraborty and M. Skrzypczyk for detailed feedback on the manuscript. ...
This work was supported by an NWO VIDI Grant, an ERC Starting Grant, and NWO Zwaartekracht QSC. ...
Protocol 4 (multiparty quantum computation (MPQC)). Input: private input ρ i for every node i, circuit R, error correcting codeĈ.
Sharing and verification 1. ...
doi:10.1103/physreva.102.022405
fatcat:swcwtt3rbfb4jdazk3wxac5rtm
Simple Proof of Security of the multiparty Prepare and Measure QKD
[article]
2022
arXiv
pre-print
Preserved Fulltext
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.
Then proved the conditional security of the multiparty prepare-and-measure QKD by the equivalency. ...
This paper examines the prepare and measure version of multiparty communication through quantum key distribution. ...
There is an exponentially small probability that Eve can cheat in this verification scheme. ...
arXiv:2204.05215v1
fatcat:wvitiav2grh2hphzohcleut4ve
Multiparty Delegated Quantum Computing
2017
Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This solution was proposed in previous studies of Blind Quantum Computation, with guarantees for both the secrecy of the input and of the computation being performed. ...
In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. ...
multiparty [7] computation, and combining them with recent work on dele-gated blind computing [8, 9, 13] . ...
doi:10.3390/cryptography1020012
fatcat:muh6bzdanrghda5n3c22rugvfe
Experimental Realization of Secure Multiparty Quantum Summation Using Five-Qubit IBM Quantum Computer on Cloud
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". ...
Experimental implementation of secure multiparty quantum summation protocol for two or more qubit secret state and the proposed protocol for square(and cubic) summation are not possible using the available ...
According to the protocol, P 1 ,P 2 and P 3 compute (y 3 i mod N ) and make their binary string and execute the secure multiparty quantum summation. ...
arXiv:1707.07460v3
fatcat:gt5n5w2od5g45fm7x5zc4zlhw4
An SLA-oriented Multiparty Trust Negotiation Model based on HCPN in Cloud Environment
2015
International Journal of u- and e- Service, Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An SLA-oriented Multiparty Trust Negotiation Architecture Cloud computing environment places resources on the cloud side and makes a lot of resources for the user to choose, so often there are multiple ...
), thus making complex process description of multiparty trust negotiation on SLA in cloud environment simple and efficient. ...
of generation is 500, the crossover probability is 0.85, and the probability of mutation is 0.01, and T=0.7. ...
doi:10.14257/ijunesst.2015.8.7.33
fatcat:dovc5cttufaajejtyomhtxzage
Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new security model for universally verifiable multiparty computation, and we present a practical construction, based on a threshold homomorphic cryptosystem. ...
Multiparty computation can be used for privacy-friendly outsourcing of computations on private inputs of multiple parties. ...
result parties, and the multiparty FS heuristic for the proofs by the computation parties. ...
doi:10.1007/978-3-319-28166-7_1
fatcat:bikukz4nqbcxfeo7dg2ww76nne
Scalable mechanisms for rational secret sharing
2014
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This may be problematic for some applications of rational secret sharing such as secure multiparty computation and simulation of a mediator. ...
1) messages and polylogarithmic number of bits. ...
is a critical component of rational multiparty computation. ...
doi:10.1007/s00446-014-0233-4
fatcat:36p6oq3txvahlcqnfsaqrmxzla
Multiparty Routing: Secure Routing for Mixnets
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work, we propose a novel multiparty routing approach for anonymous communication that addresses these shortcomings. ...
We distribute the routing decision and verify the correctness of routing to achieve routing integrity. ...
The routing verification takes the randomness (commitments openings) and computes the assignment for the next mix layer. ...
arXiv:1708.03387v2
fatcat:eswxb35xivbp5bcxl25wfi3xkm
« Previous
Showing results 1 — 15 out of 2,860 results