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...
Saved in:
| Main Authors: | , , |
|---|---|
| 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/zh/article/74656941/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|