Fair E-Cash: Be Compact, Spend Faster
INFORMATION SECURITY, PROCEEDINGS(2009)
摘要
We present the first fair e-cash system with a compact wallet that enables users to spend efficiently k coins while only sending to the merchant $\mathcal{O}(\lambda\log k)$ bits, where *** is a security parameter. The best previously known schemes require to transmit data of size at least linear in the number of spent coins. This result is achieved thanks to a new way to use the Batch RSA technique and a tree-based representation of the wallet. Moreover, we give a variant of our scheme with a less compact wallet but where the computational complexity of the spend operation does not depend on the number of spent coins, instead of being linear at best in existing systems.
更多查看译文
关键词
log k,tree-based representation,fair e-cash system,compact wallet,k coin,computational complexity,fair e-cash,security parameter,batch rsa technique,blind signature
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要