A Kind of Message-recoverable Fairness Blind Digital Signature Scheme

AbstractBlind digital signature indeed protects interests of the participants to some extent, but the anonymity of blind digital signature present exploit opportunities to attackers. Aiming at problems of current fairness blind digital signature schemes can not simultaneously guarantee completely fairness and can not recover message, the paper proposed a kind of message-recoverable fairness blind signature scheme and analyzed its correctness, security and fairness. The analysis results show that the just can authorize user's identity and correspond it to original signature message with this scheme, and the user can not forge fairness information of just

TumbleBit: an untrusted Bitcoin-compatible anonymous payment hub

This paper presents TumbleBit, a new unidirectional unlinkable payment hub that is fully compatible with today s Bitcoin protocol. TumbleBit allows parties to make fast, anonymous, off-blockchain payments through an untrusted intermediary called the Tumbler. TumbleBits anonymity properties are similar to classic Chaumian eCash: no one, not even the Tumbler, can link a payment from its payer to its payee. Every payment made via TumbleBit is backed by bitcoins, and comes with a guarantee that Tumbler can neither violate anonymity, nor steal bitcoins, nor print money by issuing payments to itself. We prove the security of TumbleBit using the real/ideal world paradigm and the random oracle model. Security follows from the standard RSA assumption and ECDSA unforgeability. We implement TumbleBit, mix payments from 800 users and show that TumbleBits offblockchain payments can complete in seconds.https://eprint.iacr.org/2016/575.pdfPublished versio

Enabling Privacy-preserving Auctions in Big Data

We study how to enable auctions in the big data context to solve many upcoming data-based decision problems in the near future. We consider the characteristics of the big data including, but not limited to, velocity, volume, variety, and veracity, and we believe any auction mechanism design in the future should take the following factors into consideration: 1) generality (variety); 2) efficiency and scalability (velocity and volume); 3) truthfulness and verifiability (veracity). In this paper, we propose a privacy-preserving construction for auction mechanism design in the big data, which prevents adversaries from learning unnecessary information except those implied in the valid output of the auction. More specifically, we considered one of the most general form of the auction (to deal with the variety), and greatly improved the the efficiency and scalability by approximating the NP-hard problems and avoiding the design based on garbled circuits (to deal with velocity and volume), and finally prevented stakeholders from lying to each other for their own benefit (to deal with the veracity). We achieve these by introducing a novel privacy-preserving winner determination algorithm and a novel payment mechanism. Additionally, we further employ a blind signature scheme as a building block to let bidders verify the authenticity of their payment reported by the auctioneer. The comparison with peer work shows that we improve the asymptotic performance of peer works' overhead from the exponential growth to a linear growth and from linear growth to a logarithmic growth, which greatly improves the scalability

Online/Offline Blind Signature

AbstractThe processing ablity and response speed of the wireless communication terminals are limited, common signatures become the bottleneck to the development of the wireless networks. For that problem, based on the characteristics of the blind signature, the online/offline blind signature is given in this paper which incorporates with the optimal online/offline signature. Most computations are finished before the blind message is given, after that, only a few operations are needed. The performance analysis is also given in this paper, the new signature scheme can be applied to the security of wireless network, it protect the users’ privacy efficiently

Quantum cryptography: key distribution and beyond

Uniquely among the sciences, quantum cryptography has driven both foundational research as well as practical real-life applications. We review the progress of quantum cryptography in the last decade, covering quantum key distribution and other applications.Comment: It's a review on quantum cryptography and it is not restricted to QK

Evaluating the design of an audit data pseudonymizer using basic building blocks for anonymity

Using an audit data pseudonymization system as an example, we show how the APES approach for basic anonymity building blocks can be used to informally evaluate the design of a given anonymity system. As a by-product we obtain indications of the usefulness and (in)completeness of the APES building blocks approach

A Postpaid Micropayment Scheme with Revocable Customers' Anonymity

[[abstract]]A new postpaid micropayment scheme is first proposed to protect customers' anonymity and provides customers' convenience. Due to customers' anonymity, customers can anonymously transact with merchants and obtain the goods/services before being charged. This scheme satisfies three properties of anonymity. First, the customer's identity is protected by a pseudonym. Second, the adversary cannot figure anonymous customers out by tracing their payments. Third, there is a trusted authority to revoke customers' anonymity when some disputes happen. On the other hand, the postpaid function provides customers with the convenience of using the credit to buy goods/services.[[notice]]補正完畢[[journaltype]]國際[[incitationindex]]EI[[booktype]]紙本[[countrycodes]]TW