Compact E-Cash
By Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya. 2005
485 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Dan Boneh
- Iddo Bentov
- Benedikt Bünz
- Markulf Kohlweiss
- Eli Ben-Sasson
- Srinath T. V. Setty
- Eran Tromer
- Elaine Shi
In Information Systems
- Dan Boneh
- Iddo Bentov
- Markulf Kohlweiss
- Jan Camenisch
- Ranjit Kumaresan
- Andrew K. Miller
- Benedikt Bünz
- Susan Hohenberger
Citations in the corpus
- Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Much of the research related to electronic payments that predates Bitcoin [Nak08] focused on efficient anonymous and confidential payments [CHL05, Cha82] .”
- Zerocash: Decentralized Anonymous Payments from Bitcoin (2014, background): “, [2]), Zerocoin employs zero-knowledge proofs to prevent transaction graph analyses.”
- The Algebraic Group Model and its Applications (2018, background): “CL signatures are a central building block for anonymous credentials [CL04, BCL04, BCS05], group signatures [CL04, ACHdM05], e-cash [CHL05], un-clonable functions [CHK + 06], batch verification [CHP07], and RFID encryption [ACdM05].”
- Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges (2015, background): “After decades of research [7, 5, 2, 25] and failed business ventures attempting to establish a digital currency, Bitcoin [23] was proposed and deployed in 2009.”
- SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies (2015, background): “time [26], allowing coins to be divided into smaller units [88] and improving efficiency [24].”
- Evaluating User Privacy in Bitcoin (2013, background): “ECash [8–10] and anonymous credit cards were the first attempts to define privacypreserving transactions.”
- Bitter to Better - How to Make Bitcoin a Better Currency (2012, background): “Ever since then, hundreds of academic papers have been published to improve the efficiency and security of e-cash constructions — to name a few, see [15,8,9].”
- Constant-Size Dynamic k-TAA (2006, methodology): “Finally, as pointed out in [20], k-TAA shares certain similarities with compact e-cash schemes, introduced in [8].”
- Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, background): “Many subsequent works improved upon these techniques while maintaining the requirement of a trusted bank: for example, by making coins divisible [32, 33] and reducing wallet size [34].”
- Double-spending fast payments in bitcoin (2012, background): “ECash [29, 30] is another form of digital cash which supports payer anonymity.”
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “These technologies include anonymous credential systems [1,2,3], pseudonym systems [4,5,6,7], anonymous e-cash [8,9, 10 ], or direct anonymous attestation [11].”
- Eclipse Attacks on Bitcoin's Peer-to-Peer Network (2015, unknown): “USENIX Association 24th USENIX Security Symposium 129 work.”
- Anonymous credentials light (2013, methodology): “Here we construct single-use anonymous credentials from blind signatures with attributes using standard techniques [17, 8, 11].”
- A Survey of Provably Secure Searchable Encryption (2014, unknown): “2005b] External co-DH (coXDH) [Ryu and Takagi 2007] Decisional Composite Residuosity (DCR)∗ [Paillier 1999] Decisional DH (DDH)∗ [Boneh 1998] Decisional DH Inversion (DDHI) [Camenisch et al. 2005] Discrete Logarithm (DL)∗ [Diffie and Hellman 1976] Decisional Linear DH (DLIN)∗ [Boneh et al.”
- Secure Multiparty Computations on Bitcoin (2014, unknown): “76 COMMUNICATIONS OF THE ACM | APRIL 2016 | VOL. 59 | NO. 4”
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, methodology): “We also use the External Diffie-Hellman (XDH) assumption used in, for example, [3,20,7] to achieve recipient anonymity, which holds on MNT curves [17].”
- How to win the clonewars: efficient periodic n-times anonymous authentication (2006, methodology): “We provide a completely different approach that yields a practical, efficient, and provably the problem to electronic cash (e-cash) [23, 24] and in particular, to compact e-cash [12].”
- How to Use Bitcoin to Design Fair Protocols (2014, background): “[24] Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya.”
- ANONIZE: A Large-Scale Anonymous Survey System (2014, unknown): “NIZKs we use rely on intuitions similar to those used in constructions of anonymous credentials (most closely related to [11] and the electronic cash/token extensions in [25], [12]), but we have different goals and rely on different complexity assumptions.”