Balancing Privacy and Accountability in Blockchain Transactions
暂无分享,去创建一个
Ivan Damgård | Luisa Siniscalchi | Claudio Orlandi | Chaya Ganesh | Hamidreza Khoshakhlagh | I. Damgård | Claudio Orlandi | Hamidreza Khoshakhlagh | C. Ganesh | Luisa Siniscalchi
[1] Angelo De Caro,et al. Privacy-preserving auditable token payments in a permissioned blockchain system , 2020, IACR Cryptol. ePrint Arch..
[2] Marcel Keller,et al. Securing DNSSEC Keys via Threshold ECDSA From Generic MPC , 2020, IACR Cryptol. ePrint Arch..
[3] Fabien Laguillaumie,et al. Bandwidth-efficient threshold EC-DSA , 2020, IACR Cryptol. ePrint Arch..
[4] Nigel P. Smart,et al. Distributing Any Elliptic Curve Based Protocol , 2019, IMACC.
[5] Sarah Meiklejohn,et al. QuisQuis: A New Design for Anonymous Cryptocurrencies , 2019, IACR Cryptol. ePrint Arch..
[6] Dario Fiore,et al. LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs , 2019, IACR Cryptol. ePrint Arch..
[7] Fabien Laguillaumie,et al. Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo p , 2018, IACR Cryptol. ePrint Arch..
[8] Shashank Agrawal,et al. Non-Interactive Zero-Knowledge Proofs for Composite Statements , 2018, IACR Cryptol. ePrint Arch..
[9] Pooya Farshim,et al. Security of Symmetric Primitives under Incorrect Usage of Keys , 2017, IACR Cryptol. ePrint Arch..
[10] Aggelos Kiayias,et al. Fair and Robust Multi-party Computation Using a Global Transaction Ledger , 2016, EUROCRYPT.
[11] David Pointcheval,et al. Short Randomizable Signatures , 2016, CT-RSA.
[12] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[13] Yi Mu,et al. Constant-Size Dynamic $k$ -Times Anonymous Authentication , 2013, IEEE Systems Journal.
[14] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[15] Craig Gentry,et al. Pinocchio: Nearly Practical Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.
[16] Markulf Kohlweiss,et al. On the Non-malleability of the Fiat-Shamir Transform , 2012, INDOCRYPT.
[17] Rafail Ostrovsky,et al. New Techniques for Noninteractive Zero-Knowledge , 2012, JACM.
[18] Dominique Unruh,et al. Security of Blind Signatures Revisited , 2012, Journal of Cryptology.
[19] Sherman S. M. Chow. Real Traceable Signatures , 2009, Selected Areas in Cryptography.
[20] Ueli Maurer,et al. Unifying Zero-Knowledge Proofs of Knowledge , 2009, AFRICACRYPT.
[21] Paz Morillo,et al. CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts , 2007, ProvSec.
[22] Jens Groth,et al. Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures , 2006, ASIACRYPT.
[23] Jan Camenisch,et al. How to win the clonewars: efficient periodic n-times anonymous authentication , 2006, CCS '06.
[24] Yi Mu,et al. Constant-Size Dynamic k-TAA , 2006, SCN.
[25] Ivan Damgård,et al. Unclonable Group Identification , 2006, IACR Cryptol. ePrint Arch..
[26] Kazue Sako,et al. k-Times Anonymous Authentication with a Constant Proving Cost , 2006, Public Key Cryptography.
[27] Reihaneh Safavi-Naini,et al. Dynamic k-Times Anonymous Authentication , 2005, ACNS.
[28] Jan Camenisch,et al. Compact E-Cash , 2005, EUROCRYPT.
[29] Yevgeniy Dodis,et al. A Verifiable Random Function with Short Proofs and Keys , 2005, Public Key Cryptography.
[30] Kazue Sako,et al. k-Times Anonymous Authentication (Extended Abstract) , 2004, ASIACRYPT.
[31] Jesper Buus Nielsen,et al. A Threshold Pseudorandom Function Construction and Its Applications , 2002, CRYPTO.
[32] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[33] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[34] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[35] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[36] Ueli Maurer,et al. Digital Payment Systems With Passive Anonymity-Revoking Trustees , 1996, J. Comput. Secur..
[37] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[38] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[39] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[40] Adam D. Smith,et al. Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC , 2018, IACR Cryptol. ePrint Arch..
[41] Neha Narula,et al. zkLedger: Privacy-Preserving Auditing for Distributed Ledgers , 2018, IACR Cryptol. ePrint Arch..
[42] Pieter Wuille,et al. Confidential Assets , 2018, Financial Cryptography Workshops.
[43] Fabien Laguillaumie,et al. Linearly Homomorphic Encryption from DDH , 2015, IACR Cryptol. ePrint Arch..
[44] Abhi Shelat,et al. How to Use SNARKs in Universally Composable Protocols , 2015, IACR Cryptol. ePrint Arch..
[45] S A R A H M E I K L E J O H N,et al. A Fistful of Bitcoins Characterizing Payments Among Men with No Names , 2013 .
[46] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.
[47] A. D. Santis,et al. Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) , 1992, FOCS 1992.
[48] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[49] David Chaum,et al. Blind Signature System , 1983, CRYPTO.