Ringct 2.0: a Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
(Linkable) Ring Signature from Hash-Then-One-Way Signature
(Linkable) Ring Signature from Hash-Then-One-Way Signature Xingye Lu Man Ho Au ∗ Zhenfei Zhang Department of Computing Department of Computing Algorand The Hong Kong Polytechnic University The Hong Kong Polytechnic University Boston, USA Hong Kong Hong Kong [email protected] [email protected] [email protected] Abstract—In this paper, we revisit the generic construction of (such as RSA) and three-move type (Type-T) signatures ring signatures from hash-then-one-way type (Type-H) signatures (discrete log (DL) based schemes such as Schnorr). While in proposed by Abe et al. (AOS) in 2004 from the following principle similar to the concrete instantiations, security proof aspects. First, we give a proof for the generic construction, in a strengthened security model. Previously, this was only done for for the AOS generic construction is not formally presented. concrete instantiations, in a weaker model. Second, we extend AOS’s framework to generically construct one-time linkable In 1994, Shor presented a quantum algorithm [4] which can ring signatures from Type-H signatures and one-time signatures. be used to break RSA and DL type digital signatures. Since Lastly, we instantiate the generic construction with an NTRU- then, significant effort has been made to develop practical based Type-H signature: FALCON and obtain a post-quantum quantum computers. Facing the potential threat from quantum linkable ring signature scheme. Our analysis shows that the computers, post-quantum cryptography has attracted more and resulting linkable signature is more efficient than any existing lattice based solutions for small to moderate number of users. -
Unique Ring Signatures: a Practical Construction
Unique Ring Signatures: A Practical Construction Matthew Franklin and Haibin Zhang Dept. of Computer Science, University of California, Davis, California 95616, USA {franklin,hbzhang}@cs.ucdavis.edu Abstract. We propose unique ring signatures that simplify and capture the spirit of linkable ring signatures. We use new techniques to provide an instantiation which can be tightly related to the DDH problem in the random oracle model, leading to the most efficient linkable/unique ring signature. Keywords: anonymity, authentication, e-voting system, provable secu- rity, ring signature, tight reduction, unique signature, verifiable random function. 1 Introduction Ring signatures [23] are very useful tools for many privacy-preserving applica- tions. However, they are not adequate in settings where some degree of priva- cy for users must be balanced against limited access. For example, a service provider might have the list of public keys that correspond to all users that have purchased a single access to some confidential service for that day (re- quiring anonymous authentication). For this kind of application, a number of restricted-use ring signatures are proposed. Notable examples include linkable ring signatures [1, 7, 19, 20, 25, 26] and traceable ring signatures [13, 14]. Linkable ring signature asks that if a user signs any two messages (same or different) with respect to the same ring, then an efficient public procedure can verify that the signer was the same (although the user's identity is not revealed). Traceable ring signature is a ring signature scheme where each message is signed not only with respect to a list of ring members, but also with respect to an issue (e.g., identifying label of a specific election or survey). -
Mechanics of Mobilecoin: First Edition
Mechanics of MobileCoin: First Edition exploring the foundations of a private digital currency April 6, 2021, Preview (10/11) v0.0.39 koe1,2 DRAFT INFORMATION: This is just a draft, and may not always be available wher- ever it is currently hosted. The final version will be available at https://github.com/ mobilecoinfoundation. License: `Mechanics of MobileCoin: First Edition' is released into the public domain. 1 [email protected] 2 Author `koe' worked on this document as part of a private contract with, then as an employee of, MobileCoin, Inc. Abstract Cryptography. It may seem like only mathematicians and computer scientists have access to this obscure, esoteric, powerful, elegant topic. In fact, many kinds of cryptography are simple enough that anyone can learn their fundamental concepts. It is common knowledge that cryptography is used to secure communications, whether they be coded letters or private digital interactions. Another application is in so-called cryptocurrencies. These digital moneys use cryptography to assign and transfer ownership of funds. To ensure that no piece of money can be duplicated or created at will, cryptocurrencies usually rely on `blockchains', which are public, distributed ledgers containing records of currency transactions that can be verified by third parties [115]. It might seem at first glance that transactions need to be sent and stored in plain text format to make them publicly verifiable. In truth, it is possible to conceal a transaction's participants, as well as the amounts involved, using cryptographic tools that nevertheless allow transactions to be verified and agreed upon by observers [151]. This is exemplified in the cryptocurrency MobileCoin. -
How to Leak a Secret: Theory and Applications of Ring Signatures
How to Leak a Secret: Theory and Applications of Ring Signatures Ronald L. Rivest1, Adi Shamir2, and Yael Tauman1 1 Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, 2 Computer Science department, The Weizmann Institute, Rehovot 76100, Israel. Abstract. In this work we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without re- vealing which member actually produced the signature. Unlike group sig- natures, ring signatures have no group managers, no setup procedures, no revocation procedures, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others' public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual email in a way that can only be veri¯ed by its intended recipient, and to solve other problems in multiparty computations. Our main contribution lies in the presentation of e±cient constructions of ring signatures; the general concept itself (under di®erent terminology) was ¯rst introduced by Cramer et al. [CDS94]. Our constructions of such signatures are unconditionally signer-ambiguous, secure in the random oracle model, and exceptionally e±cient: adding each ring member in- creases the cost of signing or verifying by a single modular multiplication and a single symmetric encryption. We also describe a large number of extensions, modi¯cations and applications of ring signatures which were published after the original version of this work (in Asiacrypt 2001). -
A Permissioned Blockchain Secure from Both Classical and Quantum Attacks
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks Amelia Holcomb Geovandro Pereira Bhargav Das∗ Michele Mosca Computer Science Combinatorics & Optimization Computer Science Combinatorics & Optimization University of Waterloo University of Waterloo University of Waterloo University of Waterloo Waterloo, Canada Waterloo, Canada Waterloo, Canada Waterloo, Canada [email protected] [email protected] [email protected] [email protected] Abstract—Hyperledger Fabric is a prominent and flexible so- the end of Round 3, about an year from now. A fourth round lution for building permissioned distributed ledger platforms. is also expected in order to select alternate candidates for Access control and identity management relies on a Mem- later standardization. bership Service Provider (MSP) whose cryptographic interface only handles standard PKI methods for authentication: RSA Open source implementations of such algorithms, for and ECDSA classical signatures. Also, MSP-issued credentials instance those provided by the Open Quantum Safe (OQS) may use only one signature scheme, tying the credential- project [1], continually change in order to keep up-to- related functions to classical single-signature primitives. RSA date with both progress in cryptanalysis and per-algorithm and ECDSA are vulnerable to quantum attacks, with an ongoing parameter modifications and optimizations. However, de- post-quantum standardization process to identify quantum- safe drop-in replacements. In this paper, we propose a redesign signing, approving, and implementing post-quantum cryp- of Fabric’s credential-management procedures and related tographic standards is only the first step. There is also the specifications in order to incorporate hybrid digital signatures, gargantuan task of integrating these algorithms into the protecting against both classical and quantum attacks using wide range of existing systems that depend on and are one classical and one quantum-safe signature. -
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation ∗
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation ¤ Chunming Tang1;y Dingyi Pei1 Zhuojun Liu2 Zheng-an Yao3 Mingsheng Wang4 1 School of Mathematics and Information Sciences, Guangzhou University, China(510006) 2 Key Laboratory of Mathematics Mechanization, AMSS, CAS, China(100080) 3 School of Mathematics and Statistics, Zhongshan University, China(510006) 4 State Key Laboratory of Information Security, Institute of Software, CAS China(100080) Abstract Commitment schemes are arguably among the most important and useful primitives in cryp- tography. According to the computational power of receivers, commitments can be classi¯ed into three possible types: computational hiding commitments, statistically hiding commitments and perfect computational commitments. The ¯st commitment with constant rounds had been constructed from any one-way functions in last centuries, and the second with non-constant rounds were constructed from any one-way functions in FOCS2006, STOC2006 and STOC2007 respectively, furthermore, the lower bound of round complexity of statistically hiding commit- n ments has been proven to be logn rounds under the existence of one-way function. Perfectly hiding commitments implies statistically hiding, hence, it is also infeasible to con- struct a practically perfectly hiding commitments with constant rounds under the existence of one-way function. In order to construct a perfectly hiding commitments with constant rounds, we have to relax the assumption that one-way functions exist. In this paper, we will construct a practically perfectly hiding commitment with two-round from any one-way permutation. To the best of our knowledge, these are the best results so far. Keywords: Cryptography, perfectly hiding commitments, one-way permutation, §-protocol. -
Quantum Bit Commitment and Coin Tossing Protocols
Quantum Bit Commitment and Coin Tossing Protocols Gilles Brassard * Claude Crepeau t Departement d'informatique et de R.O. Laboratoire de Recherche en Informatique Universite de Montreal University de Paris-Sud C.P. 6128, succ. "A" Batiment 490 Montreal, Quebec CANADA H3C 3J7 91405 Orsay FRANCE 1 Introduction In the late 1960's a physicist, Stephen Wiesner, had the idea that the uncertainty principle could be used for cryptography (though he published his result much later [Wie83]). One of his ideas was that it would be possible to use a stream of polarized photons to transmit two messages in a way that would make only one of them readable at the receiver's choosing. This notion, which he called "multiplexing", is remarkably similar to the "one-out-of-two oblivious transfer" to be reinvented many years later [EGL83], and it even predates Rabin's notion of oblivious transfer [Rab81] by more than a decade. In the late 1970's, Wiesner's invention was brought back to life by the work of Charles H. Bennett and Gilles Brassard, which resulted in a CRYPTO '82 paper [BBBW82]. Subsequently, Bennett and Brassard used quantum cryptographic principles to implement basic cryptographic protocols, such as secret key exchange and coin tossing by telephone [BB84]. There has been recently much excitement in the field of quantum cryptography because a working prototype of the quantum key exchange channel has been successfully built at the IBM T. J. Watson Research Laboratory, Yorktown Heights [BBBSS90]. In recent times, the importance of cryptographic primitives has been brought to light by the work of many researchers whose goal is to characterize precisely the primitives sufficient for the implementation of various cryptographic protocols. -
Privacy on the Blockchain: Unique Ring Signatures. Rebekah Mercer
Privacy on the Blockchain: Unique Ring Signatures. Rebekah Mercer This report is submitted as part requirement for the MSc in Information Security at University College London. 1 Supervised by Dr Nicolas T. Courtois. arXiv:1612.01188v2 [cs.CR] 25 Dec 2016 1This report is substantially the result of my own work except where explicitly indicated in the text. The report may be freely copied and distributed provided the source is explicitly acknowledged. Abstract Ring signatures are cryptographic protocols designed to allow any member of a group to produce a signature on behalf of the group, without revealing the individual signer’s identity. This offers group members a level of anonymity not attainable through generic digital signature schemes. We call this property ‘plausible deniability’, or anonymity with respect to an anonymity set. We concentrate in particular on implementing privacy on the blockchain, introducing a unique ring signature scheme that works with existing blockchain systems. We implement a unique ring signature (URS) scheme using secp256k1, creating the first implemen- tation compatible with blockchain libraries in this way, so as for easy implementation as an Ethereum smart contract. We review the privacy and security properties offered by the scheme we have constructed, and compare its efficiency with other commonly suggested approaches to privacy on the blockchain. 1 Acknowledgements Thank you to Dr Nicolas Courtois, for introducing me to blockchains and applied cryptography. Thanks to Matthew Di Ferrante, for continued insight and expertise on Ethereum and adversarial security. Thanks also to my mum and dad, for convincing me that can handle an MSc alongside a full time job, and for all the advice along the way! Finally, thanks to the University of Manchester, UCL, Yorkshire Ladies’ Trust, and countless others for their generous grants over the years, without which this MSc would not have been possible. -
ID-Based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings
ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings Amit K Awasthi1 and Sunder Lal2 1 Department of Applied Science Hindustan College of Science and Technology Farah, Mathura -281122, INDIA awasthi [email protected] 2 Department of Mathematics I. B. S. Khandari, Agra - INDIA Abstract. In 2001, Rivest et al. rstly introduced the concept of ring signatures. A ring signature is a simpli ed group signature without any manager. It protects the anonymity of a signer. The rst scheme proposed by Rivest et al. was based on RSA cryptosystem and certi cate based public key setting. The rst ring signature scheme based on DLP was proposed by Abe, Ohkubo, and Suzuki. Their scheme is also based on the general certi cate-based public key setting too. In 2002, Zhang and Kim proposed a new ID-based ring signature scheme using pairings. Later Lin and Wu proposed a more ecient ID-based ring signature scheme. Both these schemes have some inconsistency in computational aspect. In this paper we propose a new ID-based ring signature scheme and a proxy ring signature scheme. Both the schemes are more ecient than existing one. These schemes also take care of the inconsistencies in above two schemes. Keywords: Cryptography, Digital Signature, Ring Signature, Bilinear pairings, ID-based. 1 Introduction The concept of ring signature was introduced by Rivest, Shamir and Tauman in [13]. The ring signature allows a user from a set of possible signers to convince the veri er that the author of the signature belongs to the set but identity of the author is not disclosed. -
Cryptonote V 2.0 1 Introduction 2 Bitcoin Drawbacks and Some
CryptoNote v 2.0 Nicolas van Saberhagen October 17, 2013 1 Introduction \Bitcoin" [1] has been a successful implementation of the concept of p2p electronic cash. Both professionals and the general public have come to appreciate the convenient combination of public transactions and proof-of-work as a trust model. Today, the user base of electronic cash is growing at a steady pace; customers are attracted to low fees and the anonymity provided by electronic cash and merchants value its predicted and decentralized emission. Bitcoin has effectively proved that electronic cash can be as simple as paper money and as convenient as credit cards. Unfortunately, Bitcoin suffers from several deficiencies. For example, the system's distributed nature is inflexible, preventing the implementation of new features until almost all of the net- work users update their clients. Some critical flaws that cannot be fixed rapidly deter Bitcoin's widespread propagation. In such inflexible models, it is more efficient to roll-out a new project rather than perpetually fix the original project. In this paper, we study and propose solutions to the main deficiencies of Bitcoin. We believe that a system taking into account the solutions we propose will lead to a healthy competition among different electronic cash systems. We also propose our own electronic cash, \CryptoNote", a name emphasizing the next breakthrough in electronic cash. 2 Bitcoin drawbacks and some possible solutions 2.1 Traceability of transactions Privacy and anonymity are the most important aspects of electronic cash. Peer-to-peer payments seek to be concealed from third party's view, a distinct difference when compared with traditional banking. -
A New and Efficient Signature on Commitment Values
International Journal of Network Security, Vol.7, No.1, PP.101–106, July 2008 101 A New and Efficient Signature on Commitment Values Fangguo Zhang1,3, Xiaofeng Chen2,3, Yi Mu4, and Willy Susilo4 (Corresponding author: Fangguo Zhang) Department of Electronics and Communication Engineering, Sun Yat-Sen University1 Guangzhou 510275, P. R. China (Email: [email protected]) Department of Computer Science, Sun Yat-Sen University, Guangzhou 510275, P. R. China2 Guangdong Key Laboratory of Information Security Technology Guangzhou 510275, P. R. China3 School of IT and Computer Science University of Wollongong, Wollongong, NSW 2522, Australia4 (Received July 15, 2006; revised and accepted Nov. 8, 2006) Abstract user, it cannot be transferred to any one else, i.e. “non- transferability”. It is desirable that the overheads of com- We present a new short signature scheme based on a vari- munication and computation imposed by a credential sys- ant of the Boneh-Boyen’s short signatures schemes. Our tem to users and services must not heavily affect their short signature scheme is secure without requiring the performance. random oracle model. We show how to prove a commit- The studies of anonymous credential have gone through ted value embedded in our short signature. Using this several stages. After its introduction by Chaum, Brands primitive, we construct an efficient anonymous credential presented a public key based construction of anonymous system. credential in which a user can provide in zero knowledge Keywords: Anonymity, anonymous credentials, commit- that the credentials encoded by its certificate satisfy a ment, signature given linear Boolean formula [6]. This scheme allows only one show, namely, two transactions from the same user can be found performed by the same user. -
One-Way Functions Imply Secure Computation in a Quantum World
One-Way Functions Imply Secure Computation in a Quantum World James Bartusek* Andrea Coladangelo† Dakshita Khurana‡ Fermi Ma§ Abstract We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Further- more, our construction only makes black-box use of the quantum-hard one-way function. Our primary technical contribution is a construction of extractable and equivocal quantum bit commit- ments based on the black-box use of quantum-hard one-way functions in the standard model. Instantiating the Crépeau-Kilian (FOCS 1988) framework with these commitments yields simulation-secure QOT. arXiv:2011.13486v2 [quant-ph] 13 Aug 2021 *UC Berkeley. Email: [email protected] †UC Berkeley. Email: [email protected] ‡UIUC. Email: [email protected] §Princeton University and NTT Research. Email: [email protected] 1 Contents 1 Introduction 3 1.1 OurResults ...................................... ......... 4 1.2 RelatedWork ..................................... ......... 6 1.3 ConcurrentandIndependentWork. .............. 6 2 Technical Overview 8 2.1 Recap: Quantum Oblivious Transfer from Commitments . .................. 8 2.2 Our Construction: A High-Level Overview . ................ 10 2.3 Making Any Quantum (or Classical) Commitment Equivocal ................... 11 2.4 An Extractability Compiler for Equivocal Commitments . .................... 13 2.5 Putting it Together: From Commitments to Secure Computation.