5,139 Hits in 3.0 sec

An efficient simulation for quantum secure multiparty computation

Kartick Sutradhar, Hari Om
2021 Scientific Reports  
AbstractThe quantum secure multiparty computation is one of the important properties of secure quantum communication.  ...  The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol.  ...  Acknowledgements This work is partially supported by Indian Institute of technology (ISM) Dhanbad.  ... 
doi:10.1038/s41598-021-81799-z pmid:33500501 pmcid:PMC7838208 fatcat:zvavyczhjfaxznbxvp5pbsnmsy

Privacy Preserved Collaborative Secure Multiparty Data Mining

2012 Journal of Computer Science  
Results: Performance of privacy preserving collaborative data using secure multiparty computation is evaluated with attack resistance rate measured in terms of time, number of session and participants  ...  and memory for privacy preservation.  ...  The proposed secure multiparty computation method for collaborative data mining environment is efficient than the classical RSA key model.  ... 
doi:10.3844/jcssp.2012.872.878 fatcat:eqrkgk676zfqrkiavars2kdfw4

Hybrid Quantum Protocols for Secure Multiparty Summation and Multiplication

Kartick Sutradhar, Hari Om
2020 Scientific Reports  
The summation and multiplication are two basic operations for secure multiparty quantum computation.  ...  The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players.  ...  They have better communication and computation costs as the type of computation is secret-by-secret.  ... 
doi:10.1038/s41598-020-65871-8 pmid:32499534 fatcat:exlvamhyebfjtmakwvn53bggj4

Literature Survey on Secure Multiparty Anonymous Data Sharing
IJARCCE - Computer and Communication Engineering

Reshma Scaria, Lekshmi Priya S, Sushitha Susan Joseph
2015 IJARCCE  
This function helps to characterize the complexities of the secure multiparty computation.  ...  Another form of anonymity, as used in secure multiparty computation, allows multiple parties on a network to jointly carry out a global computation that depends on data from each party while the data held  ...  Computer Engineering and Intelligent Systems ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol. 6, No.1, 2015  ... 
doi:10.17148/ijarcce.2015.4166 fatcat:rvvzbxejgrgclgys4qiuwxbfey

Secure Multiparty Quantum Computation for Summation and Multiplication

Run-hua Shi, Yi Mu, Hong Zhong, Jie Cui, Shun Zhang
2016 Scientific Reports  
However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication.  ...  In this paper, we present a novel quantum approach to systematically and efficiently compute Secure Multiparty Summation and Multiplication, in which the computations of Secure Multiparty Summation and  ...  Discussion In this paper, we presented a novel and efficient quantum approach to systematically compute secure multiparty summation and multiplication.  ... 
doi:10.1038/srep19655 pmid:26792197 pmcid:PMC4726197 fatcat:5ovgcygx6ffv5nri36k3ca3twm

Multiparty Delegated Quantum Computing

Elham Kashefi, Anna Pappa
2017 Cryptography  
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.  ...  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.  ...  malicious quantum adversaries in order to provide a simple protocol for quantum multiparty computation.  ... 
doi:10.3390/cryptography1020012 fatcat:muh6bzdanrghda5n3c22rugvfe

Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation [article]

Mariano Lemus, Mariana F. Ramos, Preeti Yadav, Nuno A. Silva, Nelson J. Muga, Andre Souto, Nikola Paunkovic, Paulo Mateus, Armando N. Pinto
2019 arXiv   pre-print
However, secure multiparty computation based only on classical cryptography is severely limited by the security and efficiency of the oblivious transfer implementation.  ...  The oblivious distributed keys allow implementing a fast and secure oblivious transfer protocol, which can pave the way for the widespread of applications based on secure multiparty computation.  ...  Secure multiparty computation demands extensive use of asymmetric cryptography primitives, which are considered significantly more computationally complex than symmetric cryptography [2] .  ... 
arXiv:1909.11701v1 fatcat:mlxf5vxzi5gutfeffjugygezo4

Temporary Assumptions for Quantum Multiparty Secure Computations [article]

J. Mueller-Quade
2001 arXiv   pre-print
We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work.  ...  This paper introduces quantum multiparty protocols which allow the use of temporary assumptions.  ...  More general for every set of possibly colluding parties secure multiparty computations are possible if no two collusions cover the total set of players [16] .  ... 
arXiv:quant-ph/0010112v2 fatcat:neydexk4trhlbdeyldr4yafka4

Comparative Evaluation of Elliptic Curve Cryptography Based Homomorphic Encryption Schemes for a Novel Secure Multiparty Computation

Sankita J. Patel, Ankit Chouhan, Devesh C. Jinwala
2014 Journal of Information Security  
In this paper, we focus on Elliptic Curve Cryptography based approach for Secure Multiparty Computation (SMC) problem.  ...  We propose Elliptic Curve Cryptography (ECC) based approach for SMC that is scalable in terms of computational and communication cost and avoids TTP.  ...  Computational cost is measured as time taken for computation and communication cost is measured as number of bytes exchanged over communication channel.  ... 
doi:10.4236/jis.2014.51002 fatcat:wvansmtuy5c65bnnkjbow2ptvu

Efficient Solutions to Two-Party and Multiparty Millionaires' Problem

Xin Liu, Shundong Li, XiuBo Chen, Gang Xu, Xiaolin Zhang, Yong Zhou
2017 Security and Communication Networks  
The millionaires' problem is the basis of secure multiparty computation and has many applications.  ...  We analyze the accuracy and security of our protocols in the semihonest model and compare the computational and communication complexities between the proposed protocols and the existing ones.  ...  The computational complexity is an important measure for evaluating the efficiency of an SMC protocol.  ... 
doi:10.1155/2017/5207386 fatcat:h6ngrznrcrd5neaptbi33hwmam

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Aner Ben-Efraim, Yehuda Lindell, Eran Omri
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
In this paper, we construct highly efficient constant-round protocols for the setting of multiparty computation for semihonest adversaries.  ...  In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output.  ...  Acknowledgements We sincerely thank Meital Levy, Assi Barak, Shay Gueron, and Roi Inbar for their help on the implementations and experiments in this paper.  ... 
doi:10.1145/2976749.2978347 dblp:conf/ccs/Ben-EfraimLO16 fatcat:pdeycn26lrcmnbv7erkaqnouqq

A Survey on Privacy Preserving Data Mining Techniques

G. Jelin Taric, E. Poovammal
2017 Indian Journal of Science and Technology  
This paper explores about different various techniques for privacy preserving data mining such as anonymity, randomization, secure multiparty computation, sequential pattern hiding.  ...  Enormous amount of detailed private data is recurrently collected and analysed by applications using data mining, sharing of these data is useful to the application users.  ...  Secure multi-party computation An alternative approach based on the multiparty computation is that every part of private data is validly known to one or more parties.  ... 
doi:10.17485/ijst/2017/v10i5/111138 fatcat:tyq2deqf5rfaxenyauflke2zja

Classical multiparty computation using quantum resources

Marco Clementi, Anna Pappa, Andreas Eckstein, Ian A. Walmsley, Elham Kashefi, Stefanie Barz
2017 Physical Review A  
We also examine the type of security that can be achieved in this limited setting.  ...  Finally, we provide a proof-of-concept implementation using photonic qubits, that allows four clients to compute a specific example of a multiparty function, the pairwise AND.  ...  ACKNOWLEDGMENTS The authors would like to thank Shane Mansfield for very useful suggestions during the development of the theory and Alex E. Jones for comments on the paper.  ... 
doi:10.1103/physreva.96.062317 fatcat:fciq2sdzrnhw5mrnoipqxfcjpe

Efficient Secure Multiparty Subset Computation

Sufang Zhou, Shundong Li, Jiawei Dou, Yaling Geng, Xin Liu
2017 Security and Communication Networks  
Secure subset problem is important in secure multiparty computation, which is a vital field in cryptography.  ...  practical for inputs consisting of a large number of data.  ...  Because most secure multiparty computation protocols are constructed using public key encryption schemes, the security proof for a secure multiparty computation protocol is to reduce the security of the  ... 
doi:10.1155/2017/9717580 fatcat:xu42dj4dszgqxdjnucu5nwi4li

Multiparty Quantum Key Agreement With Strong Fairness Property

Vankamamidi S. Naresh, Sivaranjani Reddi
2020 Computer systems science and engineering  
Multiparty Key Agreement (MKA) is the backbone for secure multiparty communication.  ...  Although numerous efficient MKA-cryptosystems are available in the classical field, their security relies on the assumption that some computational issues are infeasible.  ...  Finally, I am very much grateful to the reviewers and Journal Authorities for their valuable comments in improving the paper.  ... 
doi:10.32604/csse.2020.35.457 fatcat:2lsf35hrunfy5pfpn4swoahxfi
« Previous Showing results 1 — 15 out of 5,139 results