• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 5 / 81 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) Double-Blind Compact E-cash from Bilinear Map
¿µ¹®Á¦¸ñ(English Title) Double-Blind Compact E-cash from Bilinear Map
ÀúÀÚ(Author) Jiyang Chen   Bin Lian   Yongjie Li   Jialin Cui   Ping Yu   Zhenyu Shu   Jili Tao  
¿ø¹®¼ö·Ïó(Citation) VOL 16 NO. 03 PP. 1266 ~ 1285 (2022. 03)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Compact E-cash is the first scheme which can withdraw 2l coins within 𝒪𝒪(1) operations and then store them in 𝒪𝒪(𝑙𝑙) bits. Because of its high efficiency, a lot of research has been carried out on its basis, but no previous research pay attention to the privacy of payees and in some cases, payees have the same privacy requirement as payers. We propose a double-blind compact E-cash scheme, which means that both the payer and the payee can keep anonymous while spending. In our scheme, the payer and the bank cannot determine whether the payees of two different transactions are the same one and connect the payee with transactions related to him, in this way, the privacy of the payee is protected. And our protocols disconnect the received coin from previous transaction, then, the coin can be transferred into an unspent coin which belongs to the payee. The proposed e-cash scheme is secure within y-DDHI and LRSW assumption.
Å°¿öµå(Keyword) Compact E-cash   Bilinear map   zero-knowledge proof   CL Signatures   anonymity  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå