Solution of secure multi-party multi-data raking problem based on El Gamal encryption

Based on El Gamal homomorphic encryption,a protocol of secure multi-party multi-data ranking problem was proposed.The problem extended millionaires’ problem.Furthermore,the correctness and security of this protocol were shown in semi-honest model,using the definition of secure multi-party computatio...

Full description

Saved in:
Bibliographic Details
Main Authors: LIU Wen1, LUO Shou-shan2, CHEN Ping4
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2007-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/thesisDetails?columnId=74656941&Fpath=home&index=0
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850213138338676736
author LIU Wen1
LUO Shou-shan2
CHEN Ping4
author_facet LIU Wen1
LUO Shou-shan2
CHEN Ping4
author_sort LIU Wen1
collection DOAJ
description Based on El Gamal homomorphic encryption,a protocol of secure multi-party multi-data ranking problem was proposed.The problem extended millionaires’ problem.Furthermore,the correctness and security of this protocol were shown in semi-honest model,using the definition of secure multi-party computation.The solution of secure multi-party multi-data ranking problem can form a fundamental basis of new-style electronic transaction,such as private biding and auction,secret online transaction and so on.
format Article
id doaj-art-a9c900ccf24b42e89b03b7de05ebfb94
institution OA Journals
issn 1000-436X
language zho
publishDate 2007-01-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-a9c900ccf24b42e89b03b7de05ebfb942025-08-20T02:09:11ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2007-01-011574656941Solution of secure multi-party multi-data raking problem based on El Gamal encryptionLIU Wen1LUO Shou-shan2CHEN Ping4Based on El Gamal homomorphic encryption,a protocol of secure multi-party multi-data ranking problem was proposed.The problem extended millionaires’ problem.Furthermore,the correctness and security of this protocol were shown in semi-honest model,using the definition of secure multi-party computation.The solution of secure multi-party multi-data ranking problem can form a fundamental basis of new-style electronic transaction,such as private biding and auction,secret online transaction and so on.http://www.joconline.com.cn/thesisDetails?columnId=74656941&Fpath=home&index=0secure multi-party multi-data rank;computationally indistinguishable;E1 Gamal homomorphic encryption
spellingShingle LIU Wen1
LUO Shou-shan2
CHEN Ping4
Solution of secure multi-party multi-data raking problem based on El Gamal encryption
Tongxin xuebao
secure multi-party multi-data rank;computationally indistinguishable;E1 Gamal homomorphic encryption
title Solution of secure multi-party multi-data raking problem based on El Gamal encryption
title_full Solution of secure multi-party multi-data raking problem based on El Gamal encryption
title_fullStr Solution of secure multi-party multi-data raking problem based on El Gamal encryption
title_full_unstemmed Solution of secure multi-party multi-data raking problem based on El Gamal encryption
title_short Solution of secure multi-party multi-data raking problem based on El Gamal encryption
title_sort solution of secure multi party multi data raking problem based on el gamal encryption
topic secure multi-party multi-data rank;computationally indistinguishable;E1 Gamal homomorphic encryption
url http://www.joconline.com.cn/thesisDetails?columnId=74656941&Fpath=home&index=0
work_keys_str_mv AT liuwen1 solutionofsecuremultipartymultidatarakingproblembasedonelgamalencryption
AT luoshoushan2 solutionofsecuremultipartymultidatarakingproblembasedonelgamalencryption
AT chenping4 solutionofsecuremultipartymultidatarakingproblembasedonelgamalencryption