1,259 Hits in 2.2 sec

Semi-homomorphic Encryption and Multiparty Computation [chapter]

Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias
2011 Lecture Notes in Computer Science  
We then demonstrate how semi-homomorphic encryption schemes allow us to construct an efficient multiparty computation protocol for arithmetic circuits, UC-secure against a dishonest majority.  ...  In particular, we give examples of semi-homomorphic encryption schemes based on lattices, subset sum and factoring.  ...  Examples of Semi-Homomorphic Encryption Regev's cryptosystem [Reg05] is parametrized by p, q, m and α, and is given by (G, E, D).  ... 
doi:10.1007/978-3-642-20465-4_11 fatcat:wq746gda3bhmxpvuppubvokpky

Secure Multiparty Equality Check Based on Homomorphic Cryptosystem

The proposed work is suitable for semi honest adversaries who respect rules of the protocol but somehow try to know private values with other parties.  ...  In our proposed protocol we use additive homomorphic encryption which can be defined as follows: Let PU be the public key and PR be the private key.  ...  The future work suggests devising a multiparty protocol for malicious adversaries : The party P 1 selects a random number r and computes [E PU (d 0 ) -E PU (d 1 )].r, and sends to P 0 .  ... 
doi:10.35940/ijitee.e2492.039520 fatcat:2qpoytcryrhfvebwkpgxdcfqau

Multiparty Cloud Computation [article]

Qingji Zheng, Xinwen Zhang
2012 arXiv   pre-print
We note that the problem is different from widely considered concepts, e.g., secure multiparty computation and multiparty computation with server aid.  ...  encrypted data of one user to encrypted data of target user, threshold decryption -- decrypting encrypted data by combining secret key shares obtained by a set of users, and homomorphic computation --  ...  We consider a computationally bounded adversary model -semi-honest but curious model, which specifies the behaviors of the clients and the cloud. Specifically: 1.  ... 
arXiv:1206.3717v1 fatcat:jsndu5n4lfdw5emrzft2pj3wqi

Comprehensive Research on Privacy Preserving Emphasizing on Distributed Clustering

2016 International Journal of Science and Research (IJSR)  
Significant research in privacy preserving distributed clustering is shaped on k-means clustering algorithm with secure multiparty computation (SMC).  ...  This work focuses on the previous development, existing challenges, and upcoming trends in privacy preserving kmeans clustering with horizontally and vertically distributed data.  ...  Secure multiparty computation (SMC) is such a technique which can ensure privacy in distributed environments. SMC includes homomorphic encryption, secret sharing and circuit evaluation [15] .  ... 
doi:10.21275/v5i4.nov163055 fatcat:pmmxg7htwrfiddv5ix5suumvka

Efficient and Secure Evaluation of Multivariate Polynomials and Applications [chapter]

Matthew Franklin, Payman Mohassel
2010 Lecture Notes in Computer Science  
in the computational complexity of the original semi-honest protocol.  ...  In this paper, we design efficient two-party and multiparty protocols for the same task, with security against malicious adversaries: Two-party case.  ...  A Protocol Against Semi-honest Adversaries Parties encrypt their inputs using homomorphic encryption schemes and exchange the encrypted inputs.  ... 
doi:10.1007/978-3-642-13708-2_15 fatcat:zrp7qxsdgbdsxmzmylxhfzdzum

Multiparty Homomorphic Encryption: From Theory to Practice [article]

Christian Mouchet, Juan Ramón Troncoso-Pastoriza, Jean-Pierre Hubaux
2020 IACR Cryptology ePrint Archive  
We propose and evaluate a secure-multipartycomputation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE).  ...  To support our solution, we introduce a multiparty version of the Brakerski-Fan-Vercauteren homomorphic cryptosystem and implement it in an open-source library.  ...  ACKNOWLEDGMENTS The authors would like to thank Henry Corrigan-Gibbs and our shepherd, Peeter Laud, for their valuable reviews and comments.  ... 
dblp:journals/iacr/MouchetTH20 fatcat:ohv7rl7crzapnd3e3ld57vzroe

Towards practical privacy-preserving genome-wide association study

Charlotte Bonte, Eleftheria Makri, Amin Ardeshirdavani, Jaak Simm, Yves Moreau, Frederik Vercauteren
2018 BMC Bioinformatics  
Results: We propose two provably secure solutions to address this challenge: (1) a somewhat homomorphic encryption (HE) approach, and (2) a secure multiparty computation (MPC) approach.  ...  The secure multiparty computation technique completes its execution in approximately 2 ms for data contributed by one million subjects.  ...  The funding body did not play any role in the design of the study and collection, analysis, or interpretation of data and in writing the manuscript.  ... 
doi:10.1186/s12859-018-2541-3 fatcat:jxi5l2xw3vdkplosqdi6rfxr4y

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications [chapter]

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung
2011 Lecture Notes in Computer Science  
Our generic efficient protocols are fully black-box and employ threshold additive homomorphic encryption. They do not assume honest majority, yet are robust and can detect any misbehavior.  ...  We present a robust secure methodology for computing functions that are represented as multivariate polynomials where parties hold different variables as private inputs.  ...  Protocol Overview Semi-honest structure: As described above, multivariate polynomials can be computed over additive homomorphic encryption by a round-table protocol.  ... 
doi:10.1007/978-3-642-21554-4_8 fatcat:p4ergh7g7fhclbg6iuqjymyxom

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Christian Mouchet, Juan Troncoso-Pastoriza, Jean-Philippe Bossuat, Jean-Pierre Hubaux
2021 Proceedings on Privacy Enhancing Technologies  
We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE).  ...  To support our solution, we introduce a multiparty version of the Brakerski-Fan-Vercauteren homomorphic cryptosystem and implement it in an open-source library.  ...  Acknowledgments The authors would like to thank Henry Corrigan-Gibbs and our shepherd, Peeter Laud, for their valuable reviews and comments.  ... 
doi:10.2478/popets-2021-0071 fatcat:wcfbzz5tznaazmj3vfle3rxjwu

Secure Multi-Party linear Regression

Fida Kamal Dankar, Renaud Brien, Carlisle Adams, Stan Matwin
2014 International Conference on Extending Database Technology  
The protocol uses a semi-trusted third party and delivers on privacy and complexity.  ...  Studies that combine data from multiple hospitals/data holders can tremendously improve the statistical outcome and aid in identifying efficiency markers.  ...  More specifically, we will give how many encryptions, decryptions, homomorphic multiplications (HM) and homomorphic additions (HA).  ... 
dblp:conf/edbt/DankarBAM14 fatcat:l5easb3nxvbvva7rwjaeorlxcy

Secured Friending in Proximity based Mobile Social Network

Y Vidya, B Shemimol
2015 Journal of excellence in Computer Science and Engineering  
Evaluation using real data and actual implementation shows that this mechanism improves security and is privacy preserving, verifiable and efficient.  ...  In this paper we use privacy preserving protocols with two levels of privacy along with advanced encryption standard to securely find friends with matching profiles in close proximity which is the primary  ...  Multiparty Computation (SMC) and Shamir Secret share schemes(SS) for efficient computation and communication.  ... 
doi:10.18831/ fatcat:s6zpfp7emjfw5ncbabv4mstape

Colmade: Collaborative Masking in Auditable Decryption for BFV-based Homomorphic Encryption

Alberto Ibarrondo, Hervé Chabanne, Vincent Despiegel, Melek Önen
2022 Information Hiding and Multimedia Security Workshop  
This paper proposes a novel collaborative decryption protocol for the Brakerski-Fan-Vercauteren (BFV) homomorphic encryption scheme in a multiparty distributed setting, and puts it to use in designing  ...  Allowing the computation of standard homomorphic operations over encrypted data, our protocol reveals only one least significant bit (LSB) of a scalar/vectorized result resorting to a pool of N parties  ...  Multiparty BFV Scheme Multiparty Homomorphic Encryption (MHE) provides a natural extension of FHE to an N-party setting.  ... 
doi:10.1145/3531536.3532952 dblp:conf/ih/IbarrondoCDO22 fatcat:kcty2b7sxbhmvonb6gtny5fmiu

Secure Federated Aggregate-Count Queries on Medical Patient Databases Using Fully-Homomorphic Cryptography [article]

Alexander T. Leighton, Yun William Yu
2021 bioRxiv   pre-print
Here, we prototype a new protocol using fully homomorphic encryption that is trivially secured even in the setting of quantum-capable adversaries, as it reveals no information other than that which can  ...  While many works in the computational biology community---as well as the computer science community at large---have attempted to solve this problem using differential privacy, these methods involve adding  ...  Fully Homomorphic Encryption (FHE) & Ring Learning with Errors (RLWE) A homomorphic encryption is an encryption scheme allowing some functions to be computed on cipher-texts without first decrypting.  ... 
doi:10.1101/2021.11.10.468090 fatcat:467q42hrqvcxzjs3latt77lf5u

Privacy-preserving spectral estimation in smart grid

Yue Tong, Jinyuan Sun, Kai Sun
2015 2015 IEEE International Conference on Smart Grid Communications (SmartGridComm)  
encrypted.  ...  A case study was also carried out, which showed that the proposed scheme is secure, efficient, and practical.  ...  [13] surveys existing privacy-preserving signal processing utilizing homomorphic encryption and secure multiparty computation.  ... 
doi:10.1109/smartgridcomm.2015.7436274 dblp:conf/smartgridcomm/TongSS15 fatcat:anwh5tjr7bhdtaxjolatfurigm

An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption [chapter]

Hsiao-Ying Lin, Wen-Guey Tzeng
2005 Lecture Notes in Computer Science  
Nevertheless, since multiplicative homomorphic encryption scheme is more efficient than an additive one practically, our construction saves computation time and communication bandwidth in practicality.  ...  We proposed a two-round protocol for solving the Millionaires' Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions.  ...  Recently, Schoenmakers and Tuyls [ST04] used threshold homomorphic encryption schemes as a tool to solve the multiparty computation problem.  ... 
doi:10.1007/11496137_31 fatcat:3bxtia3htndj5bcrdnmgde34wy
« Previous Showing results 1 — 15 out of 1,259 results