- 期刊
- OpenAccess
Biased Bit Commitment and Applications
並列摘要
We bring forward the primitive of biased bit commitment, define the security of the model, and present a concrete biased bit commitment scheme based on the braid conjugator search problem. The presented scheme is proved to be information-theoretically hiding and computationally binding in the defined model. Finally, to argue the usefulness of this work, we also sketch out some new applications based on this new primitive.
被引用紀錄
Tsai, I. C. (2012). 適用於無線感測網路的可適性樹狀資料收集 [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-1903201314452359
延伸閱讀
- Cheng, T. K. (2003). Development and Challenge. 光連：光電產業與技術情報, (46), 11-13. https://www.airitilibrary.com/Article/Detail?DocID=16822862-200307-x-46-11-13-a
- 吳志光（2014）。Application According to Acts and Right to Statement of Opinions。輔仁法學，(47)，b1-45。https://www.airitilibrary.com/Article/Detail?DocID=17293340-201406-201408140001-201408140001-b1-45
- 胡家瑜、王鶴森（2010）。Development and Application of Tapering Strategies。運動教練科學，(20)，11-20。https://doi.org/10.6194/SCS.2010.20.02
- 楊懿珊、鄭景峰（2010）。Assessments and Applications of the Critical Power。運動教練科學，(19)，11-24。https://doi.org/10.6194/SCS.2010.19.02
- WANG, M., BANERJEE, P., & SARRAFZADEH, M. (1998). Placement with Incomplete Data. VLSI Design, 1998(), g57-70. https://doi.org/10.1155/1999/42648