Solidus: Confidential Distributed Ledger Transactions via PVORM
暂无分享,去创建一个
Fan Zhang | Elaine Shi | Ari Juels | Ethan Cecchetti | Ahmed E. Kosba | Yan Ji | A. Juels | E. Shi | Yan Ji | Ethan Cecchetti | Fan Zhang
[1] Carlos V. Rozas,et al. Innovative instructions and software model for isolated execution , 2013, HASP '13.
[2] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[3] Elaine Shi,et al. Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts , 2016, 2016 IEEE Symposium on Security and Privacy (SP).
[4] Christof Paar,et al. Efficient E-Cash in Practice: NFC-Based Payments for Public Transportation Systems , 2013, Privacy Enhancing Technologies.
[5] Ittai Anati,et al. Innovative Technology for CPU Based Attestation and Sealing , 2013 .
[6] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[7] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[8] George Danezis,et al. Pinocchio coin: building zerocoin from a succinct pairing-based proof system , 2013, PETShop '13.
[9] Jan Camenisch,et al. Efficient group signature schemes for large groups , 1997 .
[10] Srinivas Devadas,et al. Design space exploration and optimization of path oblivious RAM in secure processors , 2013, ISCA.
[11] Fan Zhang,et al. Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge , 2017, 2017 IEEE European Symposium on Security and Privacy (EuroS&P).
[12] Kevin Lee,et al. An Empirical Analysis of Linkability in the Monero Blockchain , 2017, ArXiv.
[13] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[14] 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 .
[15] Fan Zhang,et al. Town Crier: An Authenticated Data Feed for Smart Contracts , 2016, CCS.
[16] Jan Camenisch,et al. Compact E-Cash , 2005, EUROCRYPT.
[17] Fabrice Boudot,et al. Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.
[18] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.
[19] Eli Ben-Sasson,et al. Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs , 2015, 2015 IEEE Symposium on Security and Privacy.
[20] Ethan Heilman,et al. An Empirical Analysis of Traceability in the Monero Blockchain , 2017, Proc. Priv. Enhancing Technol..
[21] Gregory Maxwell,et al. Borromean Ring Signatures ∗ , 2015 .
[22] J. Markus,et al. Millimix: Mixing in Small Batches , 1999 .
[23] I. Damgård,et al. The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.
[24] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[25] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[26] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[27] Matthew Green,et al. Zerocoin: Anonymous Distributed E-Cash from Bitcoin , 2013, 2013 IEEE Symposium on Security and Privacy.
[28] Ethan Heilman,et al. TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub , 2017, NDSS.
[29] George Danezis,et al. Centrally Banked Cryptocurrencies , 2015, NDSS.
[30] Daniel Mulligan. Know Your Customer Regulations and the International Banking System: Towards a General Self-Regulatory Regime , 1998 .
[31] Pedro Moreno-Sanchez,et al. CoinShuffle: Practical Decentralized Coin Mixing for Bitcoin , 2014, ESORICS.
[32] Giulio Malavolta,et al. Privacy and Access Control for Outsourced Personal Records , 2015, 2015 IEEE Symposium on Security and Privacy.
[33] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[34] Elaine Shi,et al. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound , 2015, IACR Cryptol. ePrint Arch..
[35] Malte Möser. Anonymity of Bitcoin Transactions An Analysis of Mixing Services , 2013 .
[36] Luke Valenta,et al. Blindcoin: Blinded, Accountable Mixes for Bitcoin , 2015, Financial Cryptography Workshops.
[37] Jan Camenisch,et al. Endorsed E-Cash , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).
[38] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[39] Aggelos Kiayias,et al. On the Portability of Generalized Schnorr Proofs , 2009, EUROCRYPT.
[40] Mahadev Konar,et al. ZooKeeper: Wait-free Coordination for Internet-scale Systems , 2010, USENIX Annual Technical Conference.
[41] Elaine Shi,et al. Bitter to Better - How to Make Bitcoin a Better Currency , 2012, Financial Cryptography.
[42] Juan del Cuvillo,et al. Using innovative instructions to create trustworthy software solutions , 2013, HASP '13.
[43] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.
[44] John K. Ousterhout,et al. In Search of an Understandable Consensus Algorithm , 2014, USENIX Annual Technical Conference.
[45] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[46] Ahmed E. Kosba,et al. Solidus : Confidential Distributed Ledger Transactions via PVORM Extended Version , 2017 .
[47] Guevara Noubir,et al. Toward Robust Hidden Volumes Using Write-Only Oblivious RAM , 2014, IACR Cryptol. ePrint Arch..
[48] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[49] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[50] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.