Optimistic Mix-net protocol based on bilinear pairings
A novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by em-ploying bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly be-tween mix-sessions to avoid providing decryption oracle service to other mix-...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2013-11-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.11.017/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841540022068576256 |
---|---|
author | Long-hai LI Shao-feng FU Rui-dan SU |
author_facet | Long-hai LI Shao-feng FU Rui-dan SU |
author_sort | Long-hai LI |
collection | DOAJ |
description | A novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by em-ploying bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly be-tween mix-sessions to avoid providing decryption oracle service to other mix-sessions. Integrity of messages during mix-ing is partially guaranteed by using dummy messages tracing technology resulting in a simpler construction for proofs“ ”of correctness. An optimization method for the joint E mal decryption involved in the protocol was also proposed, which can reduce the number of exponentiations computed by each mix server. The Mix-net will shuffle and decrypt in-put ciphertexts much faster than all previous Mix-nets with public verifiability when all mix servers execute the mixing protocol honestly. |
format | Article |
id | doaj-art-2173b6ac0ef34f719369953a0ceafaa4 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2013-11-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-2173b6ac0ef34f719369953a0ceafaa42025-01-14T06:21:47ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-11-013415316159834832Optimistic Mix-net protocol based on bilinear pairingsLong-hai LIShao-feng FURui-dan SUA novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by em-ploying bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly be-tween mix-sessions to avoid providing decryption oracle service to other mix-sessions. Integrity of messages during mix-ing is partially guaranteed by using dummy messages tracing technology resulting in a simpler construction for proofs“ ”of correctness. An optimization method for the joint E mal decryption involved in the protocol was also proposed, which can reduce the number of exponentiations computed by each mix server. The Mix-net will shuffle and decrypt in-put ciphertexts much faster than all previous Mix-nets with public verifiability when all mix servers execute the mixing protocol honestly.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.11.017/anonymous communicationoptimistic mix networkbilinear pairingsproof of secret shuffling |
spellingShingle | Long-hai LI Shao-feng FU Rui-dan SU Optimistic Mix-net protocol based on bilinear pairings Tongxin xuebao anonymous communication optimistic mix network bilinear pairings proof of secret shuffling |
title | Optimistic Mix-net protocol based on bilinear pairings |
title_full | Optimistic Mix-net protocol based on bilinear pairings |
title_fullStr | Optimistic Mix-net protocol based on bilinear pairings |
title_full_unstemmed | Optimistic Mix-net protocol based on bilinear pairings |
title_short | Optimistic Mix-net protocol based on bilinear pairings |
title_sort | optimistic mix net protocol based on bilinear pairings |
topic | anonymous communication optimistic mix network bilinear pairings proof of secret shuffling |
url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.11.017/ |
work_keys_str_mv | AT longhaili optimisticmixnetprotocolbasedonbilinearpairings AT shaofengfu optimisticmixnetprotocolbasedonbilinearpairings AT ruidansu optimisticmixnetprotocolbasedonbilinearpairings |