text:
@Article{DBLP:journals/corr/NeisseSF17,
  author    = {Ricardo Neisse and Gary Steri and Igor Nai Fovino},
  title     = {A Blockchain-based Approach for Data Accountability and Provenance Tracking},
  journal   = {CoRR},
  year      = {2017},
  volume    = {abs/1706.04507},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/NeisseSF17},
  timestamp = {Mon, 03 Jul 2017 13:29:02 +0200},
  url       = {http://arxiv.org/abs/1706.04507},
}

@Misc{gdpr,
  author = {Official Journal of the European Union (4 May 2016)},
  title  = {Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data},
  year   = {2016},
}

@Misc{eu-46ec-1995,
  author = {Official Journal of the European Union (1995)},
  title  = {Directive 95/46/EC of the European Parliament and of the Council of 24 October 1995 on the protection of individuals with regard to the processing of personal data and on the free movement of such data},
  year   = {1995},
}

@Misc{wiki:as,
  author = {Wikipedia},
  title  = {Anthem Medical Data Breach --- {W}ikipedia{,} The Free Encyclopedia},
  year   = {2017},
  note   = {[Online; accessed 12-October-2017]},
  url    = {https://en.wikipedia.org/wiki/Anthem_medical_data_breach},
}

@article{byzantine_fault_tolerance,
 author = {Lamport, Leslie and Shostak, Robert and Pease, Marshall},
 title = {The Byzantine Generals Problem},
 journal = {ACM Trans. Program. Lang. Syst.},
 issue_date = {July 1982},
 volume = {4},
 number = {3},
 month = jul,
 year = {1982},
 issn = {0164-0925},
 pages = {382--401},
 numpages = {20},
 url = {http://doi.acm.org/10.1145/357172.357176},
 doi = {10.1145/357172.357176},
 acmid = {357176},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@Misc{cardano_site,
  author = {Cardano Foundation},
  title  = {Cardano --- Cardano Foundation},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://www.cardanohub.org},
}

@Misc{cardano_parsons,
  author = {Parsons, Michael},
  title  = {Cardano: A Blockchain with Privacy and Regulation --- Cardano Foundation},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://medium.com/@BitcoinByte/a-blockchain-with-privacy-and-regulation-cardano-3606e1288bc2},
}

@Misc{consortium_chain_development,
  author = {Vitalik Buterin},
  title  = {Consortium Chain Development --- Ethereum Corporation},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://github.com/ethereum/wiki/wiki/Consortium-Chain-Development},
}

@Misc{quorum,
  author = {Morgan, J.P.},
  title  = {Quorum --- JPMorgan Chase \& Co.},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://github.com/jpmorganchase/quorum},
}

@Misc{imb_hypeledger_adv,
  author = {Singh and Sharon Cocco and Gari},
  title  = {Top technical advantages of hyperledger fabric for blockchain networks --- IBM},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://www.ibm.com/developerworks/cloud/library/cl-top-technical-advantages-of-hyperledger-fabric-for-blockchain-networks/index.html},
}

@Misc{hub-bl-types,
  author = {Hub, Blockchain},
  title  = {Blockchains and Distributed Ledger Technologies --- Blockchain Hub},
  year   = {2017},
  note   = {[Online; accessed 2017]},
  url    = {https://blockchainhub.net/blockchains-and-distributed-ledger-technologies-in-general/},
}

@Misc{ethash,
  author = {Ethereum Foundation},
  title  = {Ethash},
  year   = {2017},
  note   = {[Online; accessed 12-October-2017]},
  url    = {https://github.com/ethereum/wiki/wiki/Ethash},
}

@InProceedings{Azaria2016,
  author    = {Asaph Azaria and Ariel Ekblaw and Thiago Vieira and Andrew Lippman},
  title     = {{MedRec}: Using Blockchain for Medical Data Access and Permission Management},
  booktitle = {2016 2nd International Conference on Open and Big Data ({OBD})},
  year      = {2016},
  month     = {aug},
  publisher = {{IEEE}},
  doi       = {10.1109/obd.2016.11},
}

@Unpublished{ethereum_yellowpaper,
  author = {Dr. Gavin Wood},
  title  = {Ethereum: A secure decentralised generalised transaction ledger},
  year   = {2017},
  url    = {https://ethereum.github.io/yellowpaper/paper.pdf},
}

@article{szabo1996smart,
  title={Smart contracts: building blocks for digital markets},
  author={Szabo, Nick},
  journal={EXTROPY: The Journal of Transhumanist Thought,(16)},
  year={1996}
}

@article{btc_merchants,
  title={Bitcoin now accepted by 100,000 merchants worldwide},
  author={Cuthbertson, Anthony},
  journal={International Business Times},
  volume={4},
  year={2015}
}

@TechReport{bl_consensus,
  author      = {Dr. Arati Baliga},
  title       = {Understanding Blockchain Consensus Models},
  institution = {Persistent Systems Ltd},
  year        = {2017},
  url         = {https://www.persistent.com/wp-content/uploads/2017/04/WP-Understanding-Blockchain-Consensus-Models.pdf},
}

@TechReport{blockchain_ehr,
  author      = {Ben Yuan and Wendy Lin and and Colin McDonnell},
  title       = {Blockchains and electronic health records},
  year        = {2017},
  url         = {http://mcdonnell.mit.edu/blockchain_ehr.pdf},
}

@Article{DBLP:journals/corr/ZyskindNP15,
  author    = {Guy Zyskind and Oz Nathan and Alex Pentland},
  title     = {Enigma: Decentralized Computation Platform with Guaranteed Privacy},
  journal   = {CoRR},
  year      = {2015},
  volume    = {abs/1506.03471},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/ZyskindNP15},
  timestamp = {Wed, 07 Jun 2017 14:40:41 +0200},
  url       = {http://arxiv.org/abs/1506.03471},
}

@Article{10.1109/SPW.2015.27,
  author    = {Guy Zyskind and Oz Nathan and Alex 'Sandy' Pentland},
  title     = {Decentralizing Privacy: Using Blockchain to Protect Personal Data},
  journal   = {2015 IEEE Security and Privacy Workshops (SPW)},
  year      = {2015},
  volume    = {00},
  pages     = {180-184},
  address   = {Los Alamitos, CA, USA},
  doi       = {doi.ieeecomputersociety.org/10.1109/SPW.2015.27},
  publisher = {IEEE Computer Society},
}

@Misc{nakamoto2012bitcoin,
  author    = {Nakamoto, Satoshi},
  title     = {Bitcoin: A peer-to-peer electronic cash system},
  year      = {2009},
  added-at  = {2014-04-17T08:33:06.000+0200},
  biburl    = {https://www.bibsonomy.org/bibtex/23db66df0fc9fa2b5033f096a901f1c36/ngnn},
  interhash = {423c2cdff70ba0cd0bca55ebb164d770},
  intrahash = {3db66df0fc9fa2b5033f096a901f1c36},
  keywords  = {imported},
  timestamp = {2014-04-17T08:33:06.000+0200},
  url       = {http://www.bitcoin.org/bitcoin.pdf},
}

@TechReport{ibm,
  author      = {IBM Global Business Services Public Sector Team},
  title       = {Blockchain: The Chain of Trust and its Potential to Transform Healthcare – Our Point of View},
  institution = {IBM},
  year        = {2016},
}

@InBook{Kiayias2017,
  pages     = {357--388},
  title     = {Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol},
  publisher = {Springer International Publishing},
  year      = {2017},
  author    = {Kiayias, Aggelos and Russell, Alexander and David, Bernardo and Oliynykov, Roman},
  editor    = {Katz, Jonathan and Shacham, Hovav},
  address   = {Cham},
  isbn      = {978-3-319-63688-7},
  abstract  = {We present ``Ouroboros'', the first blockchain protocol based on proof of stake with rigorous security guarantees. We establish security properties for the protocol comparable to those achieved by the bitcoin blockchain protocol. As the protocol provides a ``proof of stake'' blockchain discipline, it offers qualitative efficiency advantages over blockchains based on proof of physical resources (e.g., proof of work). We also present a novel reward mechanism for incentivizing Proof of Stake protocols and we prove that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.},
  booktitle = {Advances in Cryptology -- CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20--24, 2017, Proceedings, Part I},
  doi       = {10.1007/978-3-319-63688-7_12},
  url       = {https://doi.org/10.1007/978-3-319-63688-7_12},
}

@InProceedings{6912770,
  author    = {K. J. O'Dwyer and D. Malone},
  title     = {Bitcoin mining and its energy footprint},
  booktitle = {25th IET Irish Signals Systems Conference 2014 and 2014 China-Ireland International Conference on Information and Communications Technologies (ISSC 2014/CIICT 2014)},
  year      = {2014},
  pages     = {280-285},
  month     = {June},
  doi       = {10.1049/cp.2014.0699},
  keywords  = {data mining;electronic money;energy conservation;Ireland;bitcoin concept;bitcoin mining;digital cryptocurrency;electricity consumption;energy cost;energy footprint;monetary transactions;Bitcoin},
}

@InProceedings{Castro:1999:PBF:296806.296824,
  author    = {Castro, Miguel and Liskov, Barbara},
  title     = {Practical Byzantine Fault Tolerance},
  booktitle = {Proceedings of the Third Symposium on Operating Systems Design and Implementation},
  year      = {1999},
  series    = {OSDI '99},
  pages     = {173--186},
  address   = {Berkeley, CA, USA},
  publisher = {USENIX Association},
  acmid     = {296824},
  isbn      = {1-880446-39-1},
  location  = {New Orleans, Louisiana, USA},
  numpages  = {14},
  url       = {http://dl.acm.org/citation.cfm?id=296806.296824},
}

@InBook{Vukolić2016,
  pages     = {112--125},
  title     = {The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication},
  publisher = {Springer International Publishing},
  year      = {2016},
  author    = {Vukoli{\'{c}}, Marko},
  editor    = {Camenisch, Jan and Kesdo{\u{g}}an, Do{\u{g}}an},
  address   = {Cham},
  isbn      = {978-3-319-39028-4},
  abstract  = {Bitcoin cryptocurrency demonstrated the utility of global consensus across thousands of nodes, changing the world of digital transactions forever. In the early days of Bitcoin, the performance of its probabilistic proof-of-work (PoW) based consensus fabric, also known as blockchain, was not a major issue. Bitcoin became a success story, despite its consensus latencies on the order of an hour and the theoretical peak throughput of only up to 7 transactions per second.},
  booktitle = {Open Problems in Network Security: IFIP WG 11.4 International Workshop, iNetSec 2015, Zurich, Switzerland, October 29, 2015, Revised Selected Papers},
  doi       = {10.1007/978-3-319-39028-4_9},
  url       = {https://doi.org/10.1007/978-3-319-39028-4_9},
}

@Article{Zohar:2015:BUH:2817191.2701411,
  author     = {Zohar, Aviv},
  title      = {Bitcoin: Under the Hood},
  journal    = {Commun. ACM},
  year       = {2015},
  volume     = {58},
  number     = {9},
  pages      = {104--113},
  month      = aug,
  issn       = {0001-0782},
  acmid      = {2701411},
  address    = {New York, NY, USA},
  doi        = {10.1145/2701411},
  issue_date = {September 2015},
  numpages   = {10},
  publisher  = {ACM},
  url        = {http://doi.acm.org/10.1145/2701411},
}

@TechReport{deloitte,
  author      = {RJ Krawiec},
  title       = {Blockchain: Opportunities for health care},
  institution = {Deloitte Conslulting LLP},
  year        = {2016},
}

@InProceedings{Third:2017:LDI:3041021.3053895,
  author    = {Third, Allan and Domingue, John},
  title     = {Linked Data Indexing of Distributed Ledgers},
  booktitle = {Proceedings of the 26th International Conference on World Wide Web Companion},
  year      = {2017},
  series    = {WWW '17 Companion},
  pages     = {1431--1436},
  address   = {Republic and Canton of Geneva, Switzerland},
  publisher = {International World Wide Web Conferences Steering Committee},
  acmid     = {3053895},
  doi       = {10.1145/3041021.3053895},
  isbn      = {978-1-4503-4914-7},
  keywords  = {blockchains, distributed ledgers, linked data, semantic indexing},
  location  = {Perth, Australia},
  numpages  = {6},
  url       = {https://doi.org/10.1145/3041021.3053895},
}

@InProceedings{Third2017LinkChainsET,
  author    = {Allan Third and John Domingue},
  title     = {LinkChains: Exploring the Space of Decentralised Trustworthy Linked Data},
  booktitle = {DeSemWeb@ISWC},
  year      = {2017},
}

@InBook{Androulaki2013,
  pages     = {34--51},
  title     = {Evaluating User Privacy in Bitcoin},
  publisher = {Springer Berlin Heidelberg},
  year      = {2013},
  author    = {Androulaki, Elli and Karame, Ghassan O. and Roeschlin, Marc and Scherer, Tobias and Capkun, Srdjan},
  editor    = {Sadeghi, Ahmad-Reza},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-642-39884-1},
  abstract  = {Bitcoin is quickly emerging as a popular digital payment system. However, in spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place are publicly announced in the system.},
  booktitle = {Financial Cryptography and Data Security: 17th International Conference, FC 2013, Okinawa, Japan, April 1-5, 2013, Revised Selected Papers},
  doi       = {10.1007/978-3-642-39884-1_4},
  url       = {https://doi.org/10.1007/978-3-642-39884-1_4},
}

@TechReport{btc_health_approach,
  author      = {Peterson and R. Deeduvanu and P. Kanjamala and K. Boles},
  title       = {A Blockchain-Based Approach to Health Information Exchange Networks},
  institution = {Mayo Clinic},
  year        = {2016},
  url         = {https://www.healthit.gov/sites/default/files/12-55-blockchain-based-approach-final.pdf},
}

@Article{Wilkinson2016,
  author        = {Wilkinson, Mark D. and Dumontier, Michel and Aalbersberg, IJsbrand Jan and Appleton, Gabrielle and Axton, Myles and Baak, Arie and Blomberg, Niklas and Boiten, Jan-Willem and da Silva Santos, Luiz Bonino and Bourne, Philip E. and Bouwman, Jildau and Brookes, Anthony J. and Clark, Tim and Crosas, Mercè and Dillo, Ingrid and Dumon, Olivier and Edmunds, Scott and Evelo, Chris T. and Finkers, Richard and Gonzalez-Beltran, Alejandra and Gray, Alasdair J. G. and Groth, Paul and Goble, Carole and Grethe, Jeffrey S. and Heringa, Jaap and ’t Hoen, Peter A. C. and Hooft, Rob and Kuhn, Tobias and Kok, Ruben and Kok, Joost and Lusher, Scott J. and Martone, Maryann E. and Mons, Albert and Packer, Abel L. and Persson, Bengt and Rocca-Serra, Philippe and Roos, Marco and van Schaik, Rene and Sansone, Susanna-Assunta and Schultes, Erik and Sengstag, Thierry and Slater, Ted and Strawn, George and Swertz, Morris A. and Thompson, Mark and van der Lei, Johan and van Mulligen, Erik and Velterop, Jan and Waagmeester, Andra and Wittenburg, Peter and Wolstencroft, Katherine and Zhao, Jun and Mons, Barend},
  title         = {The FAIR Guiding Principles for scientific data management and stewardship},
  year          = {2016},
  volume        = {3},
  pages         = {160018},
  month         = mar,
  __markedentry = {[laxmana:6]},
  publisher     = {The Author(s)},
  url           = {http://dx.doi.org/10.1038/sdata.2016.18},
}

@Article{dist_pid,
  author  = {Golodoniuc, P. and Car, N.J. and Klump, J.},
  title   = {Distributed Persistent Identifiers System Design},
  journal = {Data Science Journal},
  year    = {2017},
  volume  = {16},
  pages   = {34},
  doi     = {http://doi.org/10.5334/dsj-2017-034},
}

@InBook{Sompolinsky2015,
  pages     = {507--527},
  title     = {Secure High-Rate Transaction Processing in Bitcoin},
  publisher = {Springer Berlin Heidelberg},
  year      = {2015},
  author    = {Sompolinsky, Yonatan and Zohar, Aviv},
  editor    = {B{\"o}hme, Rainer and Okamoto, Tatsuaki},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-662-47854-7},
  abstract  = {Bitcoin is a disruptive new crypto-currency based on a decentralized open-source protocol which has been gradually gaining momentum. Perhaps the most important question that will affect Bitcoin's success, is whether or not it will be able to scale to support the high volume of transactions required from a global currency system. We investigate the implications of having a higher transaction throughput on Bitcoin's security against double-spend attacks. We show that at high throughput, substantially weaker attackers are able to reverse payments they have made, even well after they were considered accepted by recipients. We address this security concern through the GHOST rule, a modification to the way Bitcoin nodes construct and re-organize the block chain, Bitcoin's core distributed data-structure. GHOST has been adopted and a variant of it has been implemented as part of the Ethereum project, a second generation distributed applications platform.},
  booktitle = {Financial Cryptography and Data Security: 19th International Conference, FC 2015, San Juan, Puerto Rico, January 26-30, 2015, Revised Selected Papers},
  doi       = {10.1007/978-3-662-47854-7_32},
  url       = {https://doi.org/10.1007/978-3-662-47854-7_32},
}

@TechReport{mit_opal,
  author      = {Allison Ackerman Shrier, Anne Chang, Nadia Diakun-thibault, Luca Forni, Fernando Landa, Jerry Mayo, Raul van Riezen},
  title       = {Blockchain and Health IT: Algorithms, Privacy, and Data},
  institution = {Project PharmOrchard TM of MIT's Experimental Learning "MIT Fintech: Future Commerce" \& Thomas Hardjono MIT Connection Science},
  year        = {2016},
}

@TechReport{prbc_vs_pubbc,
  author      = {BitFury Group and J. Garzik},
  title       = {Public versus Private Blockchains. Part 1: Permissioned Blockchains},
  institution = {BitFury Group},
  year        = {2016},
}

@Book{Vu:2009:PCP:1671222,
  title     = {Peer-to-Peer Computing: Principles and Applications},
  publisher = {Springer Publishing Company, Incorporated},
  year      = {2009},
  author    = {Vu, Quang Hieu and Lupu, Mihai and Ooi, Beng Chin},
  edition   = {1st},
  isbn      = {3642035132, 9783642035135},
}

@Article{DBLP:journals/corr/abs-1708-05665,
  author        = {Tien Tuan Anh Dinh and Rui Liu and Meihui Zhang and Gang Chen and Beng Chin Ooi and Ji Wang},
  title         = {Untangling Blockchain: {A} Data Processing View of Blockchain Systems},
  journal       = {CoRR},
  year          = {2017},
  volume        = {abs/1708.05665},
  archiveprefix = {arXiv},
  bibsource     = {dblp computer science bibliography, http://dblp.org},
  biburl        = {http://dblp.org/rec/bib/journals/corr/abs-1708-05665},
  eprint        = {1708.05665},
  timestamp     = {Tue, 05 Sep 2017 10:03:46 +0200},
  url           = {http://arxiv.org/abs/1708.05665},
}

@book{antonopoulos2014mastering,
  title={Mastering Bitcoin},
  author={Antonopoulos, A.M.},
  isbn={9781449374044},
  lccn={2015413040},
  url={https://books.google.gr/books?id=h\_zToAEACAAJ},
  year={2014},
  publisher={O'Reilly}
}

@book{Narayanan:2016:BCT:2994437,
 author = {Narayanan, Arvind and Bonneau, Joseph and Felten, Edward and Miller, Andrew and Goldfeder, Steven},
 title = {Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction},
 year = {2016},
 isbn = {0691171696, 9780691171692},
 publisher = {Princeton University Press},
 address = {Princeton, NJ, USA},
}

@article{set,
  title={Secure electronic transactions (SET)},
  author={Merkow, Mark S},
  journal={The internet encyclopedia},
  year={2004},
  publisher={Wiley Online Library}
}

@inproceedings{chaum1983blind,
  title={Blind signatures for untraceable payments},
  author={Chaum, David},
  booktitle={Advances in cryptology},
  pages={199--203},
  year={1983},
  organization={Springer}
}

@article{cypherpunk,
  title={What happened to the crypto dream?, part 1},
  author={Narayanan, Arvind},
  journal={IEEE security \& privacy},
  volume={11},
  number={2},
  pages={75--76},
  year={2013},
  publisher={IEEE}
}

@Inbook{Chaum1983,
author="Chaum, David",
editor="Chaum, David
and Rivest, Ronald L.
and Sherman, Alan T.",
title="Blind Signatures for Untraceable Payments",
bookTitle="Advances in Cryptology: Proceedings of Crypto 82",
year="1983",
publisher="Springer US",
address="Boston, MA",
pages="199--203",
abstract="Automation of the way we pay for goods and services is already underway, as can be seen by the variety and growth of electronic banking services available to consumers. The ultimate structure of the new electronic payments system may have a substantial impact on personal privacy as well as on the nature and extent of criminal use of payments. Ideally a new payments system should address both of these seemingly conflicting sets of concerns.",
isbn="978-1-4757-0602-4",
doi="10.1007/978-1-4757-0602-4_18",
url="https://doi.org/10.1007/978-1-4757-0602-4_18"
}

@inproceedings{Chaum:1988:UEC:646753.704915,
 author = {Chaum, David and Fiat, Amos and Naor, Moni},
 title = {Untraceable Electronic Cash},
 booktitle = {Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology},
 series = {CRYPTO '88},
 year = {1990},
 isbn = {3-540-97196-3},
 pages = {319--327},
 numpages = {9},
 url = {http://dl.acm.org/citation.cfm?id=646753.704915},
 acmid = {704915},
 publisher = {Springer-Verlag},
 address = {London, UK, UK},
}

@Inbook{Watanabe1996,
author="Watanabe, Osamu
and Yamashita, Osamu",
editor="Asano, Tetsuo
and Igarashi, Yoshihide
and Nagamochi, Hiroshi
and Miyano, Satoru
and Suri, Subhash",
title="An improvement of the digital cash protocol of Okamoto and Ohta",
bookTitle="Algorithms and Computation: 7th International Symposium, ISAAC '96 Osaka, Japan, December 16--18, 1996 Proceedings",
year="1996",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="436--445",
abstract="Okamoto and Ohta [OO91, OO93] proposed a digital cash protocol and showed that it satisfies some useful properties for digital cash as well as basic requirements such as security. One of its features is ``divisibility''; i.e., a property that enables us to subdivide a piece of given digital cash into several pieces of smaller value. There is, however, some problem in their implementation of this feature: the amount of data transfer per payment may increase depending on the amount of the payment and how the coins have been used. Here we propose a new protocol by which we can fix the amount of data transfer per payment, which is much smaller than the average amount necessary in Okamoto-Ohta protocol.",
isbn="978-3-540-49633-5",
doi="10.1007/BFb0009520",
url="https://doi.org/10.1007/BFb0009520"
}

@inproceedings{merkle_tree,
  title={A digital signature based on a conventional encryption function},
  author={Merkle, Ralph C},
  booktitle={Conference on the Theory and Application of Cryptographic Techniques},
  pages={369--378},
  year={1987},
  organization={Springer}
}

@Misc{magic_money,
  author = {Cypherpunks},
  title  = {Magic Money Digicash System --- Cypherpunks},
  year   = {1994},
  note   = {[Online; accessed 2017]},
  url    = {https://cypherpunks.venona.com/date/1994/02/msg00247.html},
}

@Misc{cypherpunks_manifesto,
  author = {Eric Hughes},
  title  = {A Cypherpunk\'s Manifesto --- Eric Hughes},
  year   = {1993},
  note   = {[Online; accessed 2017]},
  url    = {https://www.activism.net/cypherpunk/manifesto.html},
}

@Inbook{Dwork1993,
author="Dwork, Cynthia and Naor, Moni",
editor="Brickell, Ernest F.",
title="Pricing via Processing or Combatting Junk Mail",
bookTitle="Advances in Cryptology --- CRYPTO' 92: 12th Annual International Cryptology Conference Santa Barbara, California, USA August 16--20, 1992 Proceedings",
year="1993",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="139--147",
abstract="We present a computational technique for combatting junk mail in particular and controlling access to a shared resource in general. The main idea is to require a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use. To this end we suggest several pricing functions, based on, respectively, extracting square roots modulo a prime, the Fiat-Shamir signature scheme, and the Ong-Schnorr-Shamir (cracked) signature scheme.",
isbn="978-3-540-48071-6",
doi="10.1007/3-540-48071-4_10",
url="https://doi.org/10.1007/3-540-48071-4_10"
}

@TECHREPORT{hash_cash,
    author = {Adam Back},
    title = {Hashcash - A Denial of Service Counter-Measure},
    institution = {},
    year = {2002}
}

@Article{Haber1991,
author="Haber, Stuart and Stornetta, W. Scott",
title="How to time-stamp a digital document",
journal="Journal of Cryptology",
year="1991",
month="Jan",
day="01",
volume="3",
number="2",
pages="99--111",
abstract="The prospect of a world in which all text, audio, picture, and video documents are in digital form on easily modifiable media raises the issue of how to certify when a document was created or last changed. The problem is to time-stamp the data, not the medium. We propose computationally practical procedures for digital time-stamping of such documents so that it is infeasible for a user either to back-date or to forward-date his document, even with the collusion of a time-stamping service. Our procedures maintain complete privacy of the documents themselves, and require no record-keeping by the time-stamping service.",
issn="1432-1378",
doi="10.1007/BF00196791",
url="https://doi.org/10.1007/BF00196791"
}

@article{b_money,
  title={b-money, 1998},
  author={Dai, Wei},
  journal={URL http://www. weidai. com/bmoney. txt},
  year={1998}
}

@unpublished{kiagias:crypto,
  author       = {Aggelos Kiayias},
  title        = {Cryptography --- Primitives and Protocol},
  note         = {Based on notes by S. Pehlivanoglu, J. Todd, K. Samari, T. Zacharias and H.S. Zhou}
}

@article{zkp,
  title={The knowledge complexity of interactive proof systems},
  author={Goldwasser, Shafi and Micali, Silvio and Rackoff, Charles},
  journal={SIAM Journal on computing},
  volume={18},
  number={1},
  pages={186--208},
  year={1989},
  publisher={SIAM}
}

@inproceedings{Quisquater:1989:EZP:118209.118269,
 author = {Quisquater, Jean-Jacques and Guillou, Louis and Annick, Marie and Berson, Tom},
 title = {How to Explain Zero-knowledge Protocols to Your Children},
 booktitle = {Proceedings on Advances in Cryptology},
 series = {CRYPTO '89},
 year = {1989},
 isbn = {0-387-97317-6},
 location = {Santa Barbara, California, USA},
 pages = {628--631},
 numpages = {4},
 url = {http://dl.acm.org/citation.cfm?id=118209.118269},
 acmid = {118269},
 publisher = {Springer-Verlag New York, Inc.},
 address = {New York, NY, USA},
}

@Misc{zkp:colour_blind,
  author = {Konstantinos Chalkias},
  title  = {Demonstrate how Zero-Knowledge Proofs work without using maths --- LinkedIn Corporation},
  year   = {2017},
  note   = {[Online; accessed 23-January-2017]},
  url    = {https://www.linkedin.com/pulse/demonstrate-how-zero-knowledge-proofs-work-without-using-chalkias/},
}

@InProceedings{10.1007/978-3-662-46803-6_10,
author="Garay, Juan and Kiayias, Aggelos and Leonardos, Nikos",
editor="Oswald, Elisabeth and Fischlin, Marc",
title="The Bitcoin Backbone Protocol: Analysis and Applications",
booktitle="Advances in Cryptology - EUROCRYPT 2015",
year="2015",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="281--310",
abstract="Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone, and prove two of its fundamental properties which we call common prefix and chain quality in the static setting where the number of players remains fixed. Our proofs hinge on appropriate and novel assumptions on the ``hashing power'' of the adversary relative to network synchronicity; we show our results to be tight under high synchronization.",
isbn="978-3-662-46803-6"
}

@INPROCEEDINGS{7163021,
author={J. Bonneau and A. Miller and J. Clark and A. Narayanan and J. A. Kroll and E. W. Felten},
booktitle={2015 IEEE Symposium on Security and Privacy},
title={SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies},
year={2015},
volume={},
number={},
pages={104-121},
keywords={cryptography;data privacy;electronic money;financial data processing;protocols;Bitcoin;computational puzzle;consensus mechanism;cryptocurrency;cryptographic currency;currency allocation mechanism;disinter mediation protocol;key management tool;privacy-enhancing proposal;Communities;Cryptography;Online banking;Peer-to-peer computing;Proposals;Protocols},
doi={10.1109/SP.2015.14},
ISSN={1081-6011},
month={May},}

@InProceedings{10.1007/978-3-319-17016-9_1,
author="Herrera-Joancomart{\'i}, Jordi",
editor="Garcia-Alfaro, Joaquin
and Herrera-Joancomart{\'i}, Jordi
and Lupu, Emil
and Posegga, Joachim
and Aldini, Alessandro
and Martinelli, Fabio
and Suri, Neeraj",
title="Research and Challenges on Bitcoin Anonymity",
booktitle="Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="3--16",
abstract="Bitcoin has emerged as the most successful crypto currency since its appearance back in 2009. Besides its security robustness, two main properties have probably been its key to success: anonymity and decentralization. In this paper, we provide a comprehensive description on the details that make such cryptocurrency an interesting research topic in the privacy community. We perform an exhaustive review of the bitcoin anonymity research papers that have been published so far and we outline some research challenges on that topic.",
isbn="978-3-319-17016-9"
}

@inproceedings{Meiklejohn:2013:FBC:2504730.2504747,
 author = {Meiklejohn, Sarah and Pomarole, Marjori and Jordan, Grant and Levchenko, Kirill and McCoy, Damon and Voelker, Geoffrey M. and Savage, Stefan},
 title = {A Fistful of Bitcoins: Characterizing Payments Among Men with No Names},
 booktitle = {Proceedings of the 2013 Conference on Internet Measurement Conference},
 series = {IMC '13},
 year = {2013},
 isbn = {978-1-4503-1953-9},
 location = {Barcelona, Spain},
 pages = {127--140},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/2504730.2504747},
 doi = {10.1145/2504730.2504747},
 acmid = {2504747},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {anonymity, bitcoin, measurement},
}

@INPROCEEDINGS{zcash,
author={E. B. Sasson and A. Chiesa and C. Garman and M. Green and I. Miers and E. Tromer and M. Virza},
booktitle={2014 IEEE Symposium on Security and Privacy},
title={Zerocash: Decentralized Anonymous Payments from Bitcoin},
year={2014},
volume={},
number={},
pages={459-474},
keywords={data privacy;electronic money;Bitcoin;DAP schemes;Zero cash;Zerocash;decentralized anonymous payment schemes;decentralized anonymous payments;full-fledged ledger-based digital currency;payment transactions;privacy guarantees;public decentralized ledger;zero-knowledge succinct noninteractive arguments of knowledge;zk-SNARKs;Logic gates;Online banking;Privacy;Protocols;Public key;Bitcoin;decentralized electronic cash;zero knowledge},
doi={10.1109/SP.2014.36},
ISSN={1081-6011},
month={May},}

@TechReport{cryptonote,
  author      = {Nicolas van Saberhagen},
  title       = {CryptoNote v 2.0},
  institution = {Persistent Systems Ltd},
  year        = {2013},
  url         = {https://cryptonote.org/whitepaper.pdf},
}

@InProceedings{10.1007/978-3-642-40084-1_6,
author="Ben-Sasson, Eli
and Chiesa, Alessandro
and Genkin, Daniel
and Tromer, Eran
and Virza, Madars",
editor="Canetti, Ran
and Garay, Juan A.",
title="SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge",
booktitle="Advances in Cryptology -- CRYPTO 2013",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="90--108",
abstract="An argument system for NP is a proof system that allows efficient verification of NP statements, given proofs produced by an untrusted yet computationally-bounded prover. Such a system is non-interactive and publicly-verifiable if, after a trusted party publishes a proving key and a verification key, anyone can use the proving key to generate non-interactive proofs for adaptively-chosen NP statements, and proofs can be verified by anyone by using the verification key.",
isbn="978-3-642-40084-1"
}

@INPROCEEDINGS{6113303,
author={F. Reid and M. Harrigan},
booktitle={2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third International Conference on Social Computing},
title={An Analysis of Anonymity in the Bitcoin System},
year={2011},
volume={},
number={},
pages={1318-1326},
keywords={electronic money;peer-to-peer computing;public key cryptography;telecommunication network topology;Bitcoin public transaction history;Bitcoin system;anonymity analysis;network topological structure;nontrivial topological structure;peer-to-peer electronic currency system;public key generation;user mapping;Context;Educational institutions;History;IP networks;Joining processes;Peer to peer computing;Public key;Anonymity;Bitcoin;Network Analysis},
doi={10.1109/PASSAT/SocialCom.2011.79},
ISSN={},
month={Oct},}

@InProceedings{10.1007/978-3-642-39884-1_2,
author="Ron, Dorit
and Shamir, Adi",
editor="Sadeghi, Ahmad-Reza",
title="Quantitative Analysis of the Full Bitcoin Transaction Graph",
booktitle="Financial Cryptography and Data Security",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="6--24",
abstract="The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). We downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper we answer for the first time a variety of interesting questions about the typical behavior of users, how they acquire and how they spend their bitcoins, the balance of bitcoins they keep in their accounts, and how they move bitcoins between their various accounts in order to better protect their privacy. In addition, we isolated all the large transactions in the system, and discovered that almost all of them are closely related to a single large transaction that took place in November 2010, even though the associated users apparently tried to hide this fact with many strange looking long chains and fork-merge structures in the transaction graph.",
isbn="978-3-642-39884-1"
}

@Article{fi5020237,
AUTHOR = {Ober, Micha and Katzenbeisser, Stefan and Hamacher, Kay},
TITLE = {Structure and Anonymity of the Bitcoin Transaction Graph},
JOURNAL = {Future Internet},
VOLUME = {5},
YEAR = {2013},
NUMBER = {2},
PAGES = {237--250},
URL = {http://www.mdpi.com/1999-5903/5/2/237},
ISSN = {1999-5903},
ABSTRACT = {The Bitcoin network of decentralized payment transactions has attracted a lot of attention from both Internet users and researchers in recent years. Bitcoin utilizes a peer-to-peer network to issue anonymous payment transactions between different users. In the currently used Bitcoin clients, the full transaction history is available at each node of the network to prevent double spending without the need for a central authority, forming a valuable source for empirical research on network structure, network dynamics, and the implied anonymity challenges, as well as guidance on the future evolution of complex payment systems. We found dynamical effects of which some increase anonymity while others decrease it. Most importantly, several parameters of the Bitcoin transaction graph seem to have become stationary over the last 12–18 months. We discuss the implications.},
DOI = {10.3390/fi5020237}
}

@article{FM548,
	author = {Nick Szabo},
	title = {Formalizing and Securing Relationships on Public Networks},
	journal = {First Monday},
	volume = {2},
	number = {9},
	year = {1997},
	keywords = {},
	abstract = {Smart contracts combine protocols with user interfaces to formalize and secure relationships over computer networks. Objectives and principles for the design of these systems are derived from legal principles, economic theory, and theories of reliable and secure protocols. Similarities and differences between smart contracts and traditional business procedures based on written contracts, controls, and static forms are discussed. By using cryptographic and other security mechanisms, we can secure many algorithmically specifiable relationships from breach by principals, and from eavesdropping or malicious interference by third parties, up to considerations of time, user interface, and completeness of the algorithmic specification. This article discusses protocols with application in important contracting areas, including credit, content rights management, payment systems, and contracts with bearer.},
	issn = {13960466},	doi = {10.5210/fm.v2i9.548},
	url = {http://ojphi.org/ojs/index.php/fm/article/view/548}
}

@misc{cryptoeprint:2015:675,
    author = {Ahmed Kosba and Andrew Miller and Elaine Shi and Zikai Wen and Charalampos Papamanthou},
    title = {Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts},
    howpublished = {Cryptology ePrint Archive, Report 2015/675},
    year = {2015},
    note = {\url{https://eprint.iacr.org/2015/675}},
}

@inproceedings{Andrychowicz:2014:SMC:2650286.2650764,
 author = {Andrychowicz, Marcin and Dziembowski, Stefan and Malinowski, Daniel and Mazurek, Lukasz},
 title = {Secure Multiparty Computations on Bitcoin},
 booktitle = {Proceedings of the 2014 IEEE Symposium on Security and Privacy},
 series = {SP '14},
 year = {2014},
 isbn = {978-1-4799-4686-0},
 pages = {443--458},
 numpages = {16},
 url = {http://dx.doi.org/10.1109/SP.2014.35},
 doi = {10.1109/SP.2014.35},
 acmid = {2650764},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 keywords = {bitocoin, multiparty computations, lottery},
}

@InProceedings{10.1007/978-3-662-44381-1_24,
author="Bentov, Iddo
and Kumaresan, Ranjit",
editor="Garay, Juan A.
and Gennaro, Rosario",
title="How to Use Bitcoin to Design Fair Protocols",
booktitle="Advances in Cryptology -- CRYPTO 2014",
year="2014",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="421--439",
abstract="We study a model of fairness in secure computation in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty. We then show how the Bitcoin network can be used to achieve the above notion of fairness in the two-party as well as the multiparty setting (with a dishonest majority). In particular, we propose new ideal functionalities and protocols for fair secure computation and fair lottery in this model.",
isbn="978-3-662-44381-1"
}

@inproceedings{Kumaresan:2014:UBI:2660267.2660380,
 author = {Kumaresan, Ranjit and Bentov, Iddo},
 title = {How to Use Bitcoin to Incentivize Correct Computations},
 booktitle = {Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security},
 series = {CCS '14},
 year = {2014},
 isbn = {978-1-4503-2957-6},
 location = {Scottsdale, Arizona, USA},
 pages = {30--41},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2660267.2660380},
 doi = {10.1145/2660267.2660380},
 acmid = {2660380},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {bitcoin, bounties, fair exchange, secure computation, verifiable computation},
}

@Misc{augur,
  author = {Augur},
  url    = {http://www.augur.net/},
  note = {\url{http://www.augur.net/}},
}

@Misc{gnosis,
  author = {Gnosis},
  url    = {https://gnosis.pm/},
  note = {\url{https://gnosis.pm/}},
}

@Misc{akasha,
  author = {Akasha},
  url    = {https://akasha.world/},
  note = {\url{https://akasha.world/}},
}

@Misc{backfeed,
  author = {Backfeed},
  url    = {http://backfeed.cc/},
  note = {\url{http://backfeed.cc/}},
}

@Misc{etheroll,
  author = {Etheroll},
  url    = {https://etheroll.com/},
  note = {\url{https://etheroll.com/}},
}

@Misc{coinpoker,
  author = {Coinpoker},
  url    = {https://coinpoker.com/},
  note = {\url{https://coinpoker.com/}},
}

@Misc{cryptokitties,
  author = {Cryptokitties},
  url    = {https://www.cryptokitties.co/},
  note = {\url{https://www.cryptokitties.co/}},
}

@Misc{pikciochain,
  author = {Pikciochain},
  url    = {https://pikciochain.com/en/},
  note = {\url{https://pikciochain.com/en/}},
}

@InProceedings{ggpr,
author="Gennaro, Rosario
and Gentry, Craig
and Parno, Bryan
and Raykova, Mariana",
editor="Johansson, Thomas
and Nguyen, Phong Q.",
title="Quadratic Span Programs and Succinct NIZKs without PCPs",
booktitle="Advances in Cryptology -- EUROCRYPT 2013",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="626--645",
abstract="We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main motivation is the quick construction of succinct, easily verified arguments for NP statements.",
isbn="978-3-642-38348-9"
}

@inproceedings{pinocchio-nearly-practical-verifiable-computation,
author = {Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana},
title = {Pinocchio: Nearly Practical Verifiable Computation},
booktitle = {Proceedings of the IEEE Symposium on Security and Privacy},
year = {2013},
month = {May},
abstract = {

To instill greater confidence in computations outsourced to the cloud, clients should be able to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions. With Pinocchio, the client creates a public evaluation key to describe her computation; this setup is proportional to evaluating the computation once. The worker then evaluates the computation on a particular input and uses the evaluation key to produce a proof of correctness. The proof is only 288 bytes, regardless of the computation performed or the size of the inputs and outputs. Anyone can use a public verification key to check the proof.

Crucially, our evaluation on seven applications demonstrates that Pinocchio is efficient in practice too. Pinocchio's verification time is typically 10ms: 5-7 orders of magnitude less than previous work; indeed Pinocchio is the first general-purpose system to demonstrate verification cheaper than native execution (for some apps). Pinocchio also reduces the worker's proof effort by an additional 19-60x. As an additional feature, Pinocchio generalizes to zero-knowledge proofs at a negligible cost over the base protocol. Finally, to aid development, Pinocchio provides an end-to-end toolchain that compiles a subset of C into programs that implement the verifiable computation protocol.

For the full version of our paper, including a correction to the verification procedure, see http://eprint.iacr.org/2013/279

Pinocchio's source code is also available! Visit https://vc.codeplex.com for more info.

Coverage from the MIT Technology Review: http://www.technologyreview.com/news/515081/microsoft-and-ibm-researchers-develop-a-lie-detector-for-the-cloud/

},
publisher = {IEEE},
url = {https://www.microsoft.com/en-us/research/publication/pinocchio-nearly-practical-verifiable-computation/},
address = {},
pages = {},
journal = {},
volume = {},
chapter = {},
isbn = {},
}

@inproceedings {184425,
author = {Eli Ben-Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza},
title = {Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture},
booktitle = {23rd {USENIX} Security Symposium ({USENIX} Security 14)},
year = {2014},
isbn = {978-1-931971-15-7},
address = {San Diego, CA},
pages = {781--796},
url = {https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/ben-sasson},
publisher = {{USENIX} Association},
}

@TechReport{zksnarks_nutshell,
  author      = {Christian Reitwießner},
  title       = {zkSNARKs in a Nutshell},
  year        = {2016},
  url         = {https://chriseth.github.io/notes/articles/zksnarks/zksnarks.pdf},
}

@InProceedings{knowledge_of_exponent,
author="Bellare, Mihir
and Palacio, Adriana",
editor="Franklin, Matt",
title="The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols",
booktitle="Advances in Cryptology -- CRYPTO 2004",
year="2004",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="273--289",
abstract="Hada and Tanaka [11,12] showed the existence of 3-round, negligible-error zero-knowledge arguments for NP based on a pair of non-standard assumptions, here called KEA1 and KEA2. In this paper we show that KEA2 is false. This renders vacuous the results of [11,12]. We recover these results, however, under a suitably modified new assumption called KEA3. What we believe is most interesting is that we show that it is possible to ``falsify'' assumptions like KEA2 that, due to their nature and quantifier-structure, do not lend themselves easily to ``efficient falsification'' (Naor [15]).",
isbn="978-3-540-28628-8"
}

@Misc{big_data_better_worse,
  author = {ScienceDaily},
  title  = {Big Data, for better or worse: 90\% of world's data generated over last two years},
  year   = {2013},
  url    = {https://www.sciencedaily.com/releases/2013/05/130522085217.htm},
}``

@TECHREPORT {emergence_new_assets_wef,
    author      = "K Schwab and A Marcus and JO Oyola and W Hoffman and M Luzi",
    title       = "The emergence of a new asset class",
    institution = "An Initiative of the World Economic Forum",
    year        = "2011"
}

@Misc{data_new_oil_01,
  author = {Michael Palmer},
  title  = {Data is the New Oil},
  year   = {2006},
  url    = {http://ana.blogs.com/maestros/2006/11/data_is_the_new.html},
}

@Misc{data_new_oil_02,
  author = {Meglena Kuneva},
  title  = {Roundtable on Online Data Collection, Targeting and Profiling },
  year   = {2009},
  url    = {http://europa.eu/rapid/press-release_SPEECH-09-156_en.htm},
}

@Misc{data_new_oil_03,
  author = {Richard Titus},
  title  = {Data is the New Oil},
  year   = {2006},
  url    = {https://www.slideshare.net/rxdxt/data-is-the-new-oil},
}

@Misc{data_new_oil_04,
  author = {Peter Sondergaard},
  title  = {Gartner Says Worldwide Enterprise IT Spending to Reach \$2.7 Trillion in 2012},
  year   = {2011},
  url    = {https://www.gartner.com/newsroom/id/1824919},
}

@Misc{data_new_oil_05,
  author = {Declan McCullagh},
  title  = {Verizon draws fire for monitoring app usage, browsing habits},
  year   = {2012},
  url    = {https://www.cnet.com/news/verizon-draws-fire-for-monitoring-app-usage-browsing-habits/},
}

@Misc{data_new_oil_06,
  author = {Maria Deutscher},
  title  = {IBM’s CEO Says Big Data is Like Oil, Enterprises Need Help Extracting the Value},
  year   = {2013},
  url    = {https://siliconangle.com/blog/2013/03/11/ibms-ceo-says-big-data-is-like-oil-enterprises-need-help-extracting-the-value/},
}

@Misc{data_new_oil_07,
  author = {Rachel Arthur},
  title  = {Data Is the New Oil’ and More from SXSW},
  year   = {2016},
  url    = {https://www.businessoffashion.com/articles/fashion-tech/data-is-the-new-oil-and-more-from-sxsw},
}

@Misc{data_new_oil_08,
  author = {Matt Day},
  title  = {Microsoft touts developer tools, business software at Build},
  year   = {2016},
  url    = {https://www.seattletimes.com/business/microsoft/microsoft-touts-developer-tools-business-software/},
}

@Misc{data_new_oil_09,
  author = {Michael Haupt},
  title  = {“Data is the New Oil” — A Ludicrous Proposition},
  year   = {2016},
  url    = {https://medium.com/twenty-one-hundred/data-is-the-new-oil-a-ludicrous-proposition-1d91bba4f294},
}

@techreport{pii,
  title={Guide to protecting the confidentiality of personally identifiable information (PII)},
  author={McCallister, Erika and Grance, Timothy and Scarfone, Karen A},
  year={2010}
}

@TechReport{ipfs,
  author      = {Juan Benet},
  title       = {IPFS - Content Addressed, Versioned, P2P File System},
  year        = {2014},
  url         = {https://github.com/ipfs/papers/raw/master/ipfs-cap2pfs/ipfs-p2p-file-system.pdf},
}

@TechReport{filecoin,
  author      = {Protocol Labs},
  title       = {Filecoin: A Decentralized Storage Network},
  year        = {2017},
  url         = {https://filecoin.io/filecoin.pdf},
}

@TechReport{storj,
  author      = {Wilkinson, Shawn and Boshevski, Tome and Brandoff, Josh and Prestwich, James and Hall, Gordon and Gerbes, Patrick and Hutchins, Philip and Pollard, Chris},
  title       = {Storj: A Peer-to-Peer Cloud Storage Network},
  year        = {2016},
  url         = {https://storj.io/storj.pdf},
}

@article{Blum:1991:NZ:123137.123145,
 author = {Blum, Manuel and De Santis, Alfredo and Micali, Silvio and Persiano, Giuseppe},
 title = {Noninteractive Zero-knowledge},
 journal = {SIAM J. Comput.},
 issue_date = {Dec. 1991},
 volume = {20},
 number = {6},
 month = dec,
 year = {1991},
 issn = {0097-5397},
 pages = {1084--1118},
 numpages = {35},
 url = {https://doi.org/10.1137/0220068},
 doi = {10.1137/0220068},
 acmid = {123145},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
}

@inproceedings{Bitansky:2012:ECR:2090236.2090263,
 author = {Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran},
 title = {From Extractable Collision Resistance to Succinct Non-interactive Arguments of Knowledge, and Back Again},
 booktitle = {Proceedings of the 3rd Innovations in Theoretical Computer Science Conference},
 series = {ITCS '12},
 year = {2012},
 isbn = {978-1-4503-1115-1},
 location = {Cambridge, Massachusetts},
 pages = {326--349},
 numpages = {24},
 url = {http://doi.acm.org/10.1145/2090236.2090263},
 doi = {10.1145/2090236.2090263},
 acmid = {2090263},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@inproceedings{forth_lang,
  title={The evolution of Forth},
  author={Rather, Elizabeth D and Colburn, Donald R and Moore, Charles H},
  booktitle={ACM Sigplan Notices},
  volume={28},
  number={3},
  pages={177--199},
  year={1993},
  organization={ACM}
}

@TECHREPORT{Samarati98protectingprivacy,
    author = {Pierangela Samarati and Latanya Sweeney},
    title = {Protecting Privacy when Disclosing Information: k-Anonymity and Its Enforcement through Generalization and Suppression},
    institution = {},
    year = {1998}
  }

@Inbook{Aggarwal2008,
  author="Aggarwal, Charu C.
  and Yu, Philip S.",
  title="A General Survey of Privacy-Preserving Data Mining Models and Algorithms",
  bookTitle="Privacy-Preserving Data Mining: Models and Algorithms        ",
  year="2008",
  publisher="Springer US",
  address="Boston, MA",
  pages="11--52",
  abstract="In recent years, privacy-preserving data mining has been studied extensively, because of the wide proliferation of sensitive information on the internet. A number of algorithmic techniques have been designed for privacy-preserving data mining. In this paper, we provide a review of the state-of-the-art methods for privacy. We discuss methods for randomization, k-anonymization, and distributed privacy-preserving data mining. We also discuss cases in which the output of data mining applications needs to be sanitized for privacy-preservation purposes. We discuss the computational and theoretical limits associated with privacy-preservation over high dimensional data sets.",
  isbn="978-0-387-70992-5",
  doi="10.1007/978-0-387-70992-5_2",
  url="https://doi.org/10.1007/978-0-387-70992-5_2"
}

@book{adams_understanding_2003,
	address = {Boston},
	edition = {2nd ed},
	title = {Understanding {PKI}: concepts, standards, and deployment considerations},
	isbn = {978-0-672-32391-1},
	shorttitle = {Understanding {PKI}},
	publisher = {Addison-Wesley},
	author = {Adams, Carlisle and Lloyd, Steve and Adams, Carlisle},
	year = {2003},
	keywords = {Business enterprises, Computer networks, Computer networks Security measures, Public key infrastructure (Computer security), Security measures},
	annote = {Revised ed. of: Understanding public-key infrastructure. 1999}
}

@techreport{pankova_succinct_2013,
	title = {Succinct {Non}-{Interactive} {Arguments} from {Quadratic} {Arithmetic} {Programs}},
	url = {https://courses.cs.ut.ee/MTAT.07.022/2013_fall/uploads/Main/alisa-report},
	urldate = {2018-03-23},
	institution = {University of Tartu, Cybernetica AS},
	author = {Pankova, Alisa},
	month = dec,
	year = {2013},
	pages = {28}
}

@Misc{pequin,
  author = {Pepper Project},
  title  = {Pequin: An end-to-end toolchain for verifiable computation, SNARKs, and probabilistic proofs},
  year   = {2018},
  url    = {https://github.com/pepper-project/pequin},
}

@Misc{libsnark,
  author = {SCIPR Lab},
  title  = {libsnark: a C++ library for zkSNARK proofs},
  year   = {2018},
  url    = {https://github.com/scipr-lab/libsnark},
}

@Misc{ECMA_2015,
  author = {Ecma International},
  title  = {ECMAScript® 2015 Language Specification},
  year   = {2018},
  url    = {https://www.ecma-international.org/ecma-262/6.0/index.html},
}

@Misc{stdjs,
  author = {Feross Aboukhadijeh},
  title  = {Java{S}cript Standard Style},
  year   = {2018},
  url    = {https://standardjs.com/},
}

@Misc{ganache,
  author = {Consensys},
  title  = {Ganache},
  year   = {2018},
  url    = {https://github.com/trufflesuite/ganache-cli},
}

@Misc{truffle,
  author = {Consensys},
  title  = {Truffle},
  year   = {2018},
  url    = {http://truffleframework.com/},
}

@Misc{solidity,
  author = {Ethereum Foundation},
  title  = {The solidity contract-oriented programming language},
  year   = {2018},
  url    = {https://github.com/ethereum/solidity},
}

@Misc{nodejs,
  title  = {Node.js},
  author = {Node.js Foundation},
  year   = {2018},
  url    = {https://nodejs.org/},
}

@Misc{expressjs,
  author = {Node.js Foundation},
  title  = {Express: Fast, unopinionated, minimalist web framework for Node.js},
  year   = {2017},
  url    = {https://expressjs.com/},
}

@Misc{react,
  author = {Facebook Inc.},
  title  = {React: A JavaScript library for building user interfaces},
  year   = {2018},
  url    = {https://reactjs.org/},
}

@Misc{redux,
  author = {Redux},
  title  = {Redux: Predictable state container for JavaScript apps},
  year   = {2018},
  url    = {https://redux.js.org/},
}

@Misc{bootstrap,
  author = {Bootstrap Authors},
  title  = {Bootstrap: The most popular HTML, CSS, and JavaScript framework for developing responsive, mobile first projects on the web},
  year   = {2018},
  url    = {https://getbootstrap.com/},
}

@Misc{web3js,
  author = {Ethereum},
  title  = {web3.js: Ethereum JavaScript API },
  year   = {2018},
  url    = {https://github.com/ethereum/web3.js/},
}

@INPROCEEDINGS{sjcl,
  author={E. Stark and M. Hamburg and D. Boneh},
  booktitle={2009 Annual Computer Security Applications Conference},
  title={Symmetric Cryptography in Javascript},
  year={2009},
  volume={},
  number={},
  pages={373-381},
  keywords={Java;cryptography;hypermedia markup languages;program interpreters;software libraries;Javascript crypto library;Javascript interpreter;ciphers;symmetric cryptography library;Application software;Clouds;Computer science;Computer security;Cryptography;Internet;Java;Medical services;Software libraries;Web server;Javascript;cryptography;optimization},
  doi={10.1109/ACSAC.2009.42},
  ISSN={1063-9527},
  month={Dec},
}

@Misc{satoshi_mailing_list,
  author = {The Mail Archive},
  title  = {Satoshi\'s posts to Cryptography mailing list},
  year   = {2008},
  note   = {[Online; accessed 2018]},
  url    = {https://www.mail-archive.com/search?l=cryptography@metzdowd.com&q=from:%22Satoshi+Nakamoto%22},
}

@Misc{btc_client,
  author = {The Mail Archive},
  title  = {Bitcoin v0.1 released},
  year   = {2009},
  note   = {[Online; accessed 2018]},
  url    = {https://www.mail-archive.com/cryptography@metzdowd.com/msg10142.html},
}

@Misc{btc_first_block,
  author = {Bitcoin Block Explorer},
  title  = {Bitcoin Block 0},
  year   = {2009},
  note   = {[Online; accessed 2018]},
  url    = {https://blockexplorer.com/block/000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f},
}

@Misc{btc_cap,
  author = {CoinMarketCap},
  title  = {Bitcoin Market Cap},
  year   = {2018},
  note   = {[Online; accessed 2018]},
  url    = {https://coinmarketcap.com/currencies/bitcoin/},
}

@InProceedings{10.1007/978-3-319-70278-0_8,
author="Ruffing, Tim
and Moreno-Sanchez, Pedro",
editor="Brenner, Michael
and Rohloff, Kurt
and Bonneau, Joseph
and Miller, Andrew
and Ryan, Peter Y.A.
and Teague, Vanessa
and Bracciali, Andrea
and Sala, Massimiliano
and Pintore, Federico
and Jakobsson, Markus",
title="ValueShuffle: Mixing Confidential Transactions for Comprehensive Transaction Privacy in Bitcoin",
booktitle="Financial Cryptography and Data Security",
year="2017",
publisher="Springer International Publishing",
address="Cham",
pages="133--154",
abstract="The public nature of the blockchain has been shown to be a severe threat for the privacy of Bitcoin users. Even worse, since funds can be tracked and tainted, no two coins are equal, and fungibility, a fundamental property required in every currency, is at risk. With these threats in mind, several privacy-enhancing technologies have been proposed to improve transaction privacy in Bitcoin. However, they either require a deep redesign of the currency, breaking many currently deployed features, or they address only specific privacy issues and consequently provide only very limited guarantees when deployed separately.",
isbn="978-3-319-70278-0"
}

@INPROCEEDINGS{Bonneau14e.w.:mixcoin,
  author = {Joseph Bonneau and Arvind Narayanan and Andrew Miller and Jeremy Clark and Joshua A. Kroll and Edward W. Felten},
  title = {Mixcoin: Anonymity for Bitcoin with accountable mixes},
  booktitle = {In: Financial Cryptography and Data Security},
  year = {2014}
}

@InProceedings{10.1007/978-3-662-44774-1_9,
author="Saxena, Amitabh
and Misra, Janardan
and Dhar, Aritra",
editor="B{\"o}hme, Rainer
and Brenner, Michael
and Moore, Tyler
and Smith, Matthew",
title="Increasing Anonymity in Bitcoin",
booktitle="Financial Cryptography and Data Security",
year="2014",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="122--139",
abstract="Bitcoin prevents double-spending using the blockchain, a public ledger kept with every client. Every single transaction till date is present in this ledger. Due to this, true anonymity is not present in bitcoin. We present a method to enhance anonymity in bitcoin-type cryptocurrencies. In the blockchain, each block holds a list of transactions linking the sending and receiving addresses. In our modified protocol the transactions (and blocks) do not contain any such links. Using this, we obtain a far higher degree of anonymity. Our method uses a new primitive known as composite signatures. Our security is based on the hardness of the Computation Diffie-Hellman assumption in bilinear maps.",
isbn="978-3-662-44774-1"
}

@inproceedings{Babaioff:2012:BRB:2229012.2229022,
 author = {Babaioff, Moshe and Dobzinski, Shahar and Oren, Sigal and Zohar, Aviv},
 title = {On Bitcoin and Red Balloons},
 booktitle = {Proceedings of the 13th ACM Conference on Electronic Commerce},
 series = {EC '12},
 year = {2012},
 isbn = {978-1-4503-1415-2},
 location = {Valencia, Spain},
 pages = {56--73},
 numpages = {18},
 url = {http://doi.acm.org/10.1145/2229012.2229022},
 doi = {10.1145/2229012.2229022},
 acmid = {2229022},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {information propagation, mechanism design, sybil-proof mechanisms},
}

@InProceedings{10.1007/978-3-319-70278-0_17,
author="Liao, Kevin
and Katz, Jonathan",
editor="Brenner, Michael
and Rohloff, Kurt
and Bonneau, Joseph
and Miller, Andrew
and Ryan, Peter Y.A.
and Teague, Vanessa
and Bracciali, Andrea
and Sala, Massimiliano
and Pintore, Federico
and Jakobsson, Markus",
title="Incentivizing Blockchain Forks via Whale Transactions",
booktitle="Financial Cryptography and Data Security",
year="2017",
publisher="Springer International Publishing",
address="Cham",
pages="264--279",
abstract="Bitcoin's core innovation is its solution to double-spending, called Nakamoto consensus. This provides a probabilistic guarantee that transactions will not be reversed or redirected, presuming that it is improbable for an attacker to obtain a majority of mining power in the network. However, this guarantee can be undermined when miners are assumed to be rational, and hence venal. Accordingly, we present the whale attack, in which a minority attacker increases her chances of double-spending by incentivizing miners to subvert the consensus protocol and to collude via whale transactions, which are bribery transactions carrying anomalously large fees. We analyze the expected cost to carry out the attack with success probability 1, and simulate the attack under realistic system parameters. Our results show that double-spend attacks, conventionally thought to be impractical for minority attackers, can actually be financially feasible and worthwhile under the whale attack. Perhaps more importantly, this work demonstrates that rationality should not underestimated when evaluating the security of cryptocurrencies.",
isbn="978-3-319-70278-0"
}

@inproceedings{Bentov2017DecentralizedPM,
  title={Decentralized Prediction Market Without Arbiters},
  author={Iddo Bentov and Alex Mizrahi and Meni Rosenfeld},
  booktitle={Financial Cryptography Workshops},
  year={2017}
}

@inproceedings{Carlsten:2016:IBW:2976749.2978408,
 author = {Carlsten, Miles and Kalodner, Harry and Weinberg, S. Matthew and Narayanan, Arvind},
 title = {On the Instability of Bitcoin Without the Block Reward},
 booktitle = {Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security},
 series = {CCS '16},
 year = {2016},
 isbn = {978-1-4503-4139-4},
 location = {Vienna, Austria},
 pages = {154--167},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/2976749.2978408},
 doi = {10.1145/2976749.2978408},
 acmid = {2978408},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {bitcoin, cryptocurrencies, equilibrium, game theory, learning, selfish mining, simulator},
}

@article{DBLP:journals_corr_Bahack13,
  author    = {Lear Bahack},
  title     = {Theoretical Bitcoin Attacks with less than Half of the Computational
               Power (draft)},
  journal   = {CoRR},
  volume    = {abs/1312.7013},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.7013},
  archivePrefix = {arXiv},
  eprint    = {1312.7013},
  timestamp = {Wed, 07 Jun 2017 14:42:12 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Bahack13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals_corr_EyalS13,
  author    = {Ittay Eyal and
               Emin G{\"{u}}n Sirer},
  title     = {Majority is not Enough: Bitcoin Mining is Vulnerable},
  journal   = {CoRR},
  volume    = {abs/1311.0243},
  year      = {2013},
  url       = {http://arxiv.org/abs/1311.0243},
  archivePrefix = {arXiv},
  eprint    = {1311.0243},
  timestamp = {Wed, 07 Jun 2017 14:41:57 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/EyalS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@InProceedings{10.1007/978-3-662-44774-1_7,
author="Donet Donet, Joan Antoni
and P{\'e}rez-Sol{\`a}, Cristina
and Herrera-Joancomart{\'i}, Jordi",
editor="B{\"o}hme, Rainer
and Brenner, Michael
and Moore, Tyler
and Smith, Matthew",
title="The Bitcoin P2P Network",
booktitle="Financial Cryptography and Data Security",
year="2014",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="87--102",
abstract="The Bitcoin virtual currency is built on the top of a decentralized peer-to-peer (P2P) network used to propagate system information such as transactions or blockchain updates. In this paper, we have performed a data collection process identifying more than 872000 different Bitcoin nodes. This data allows us to present information on the size of the Bitcoin P2P network, the node geographic distribution, the network stability in terms of interrupted availability of nodes, as well as some data regarding the propagation time of the transmitted information. Furthermore, although not every Bitcoin user can be identified as a P2P network node, measurements of the P2P network can be considered as a lower bound for Bitcoin usage, and they provide interesting results on the adoption of such virtual currency.",
isbn="978-3-662-44774-1"
}

@inproceedings {190890,
author = {Ethan Heilman and Alison Kendler and Aviv Zohar and Sharon Goldberg},
title = {Eclipse Attacks on Bitcoin{\textquoteright}s Peer-to-Peer Network},
booktitle = {24th {USENIX} Security Symposium ({USENIX} Security 15)},
year = {2015},
isbn = {978-1-931971-232},
address = {Washington, D.C.},
pages = {129--144},
url = {https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/heilman},
publisher = {{USENIX} Association},
}

@misc{kiayias2017non,
  title={Non-interactive proofs of proof-of-work},
  author={Kiayias, Aggelos and Miller, Andrew and Zindros, Dionysis},
  year={2017}
}

@InProceedings{10.1007/978-3-662-53357-4_5,
  author="Kiayias, Aggelos
  and Lamprou, Nikolaos
  and Stouka, Aikaterini-Panagiota",
  editor="Clark, Jeremy
  and Meiklejohn, Sarah
  and Ryan, Peter Y.A.
  and Wallach, Dan
  and Brenner, Michael
  and Rohloff, Kurt",
  title="Proofs of Proofs of Work with Sublinear Complexity",
  booktitle="Financial Cryptography and Data Security",
  year="2016",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  pages="61--78",
  abstract="In the setting of blockchain based transaction ledgers we study the problem of ``simplified payment verification'' (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some ``checkpoint'' block that is known to it).",
  isbn="978-3-662-53357-4"
}

@Misc{btc_bl_size,
  author = {blockchain.info},
  title  = {Bitcoin Blockchain Size},
  year   = {2018},
  note   = {[Online; accessed 2018]},
  url    = {https://blockchain.info/charts/blocks-size},
}

@InProceedings{10.1007/978-3-662-53357-4_8,
author="Croman, Kyle
and Decker, Christian
and Eyal, Ittay
and Gencer, Adem Efe
and Juels, Ari
and Kosba, Ahmed
and Miller, Andrew
and Saxena, Prateek
and Shi, Elaine
and G{\"u}n Sirer, Emin
and Song, Dawn
and Wattenhofer, Roger",
editor="Clark, Jeremy
and Meiklejohn, Sarah
and Ryan, Peter Y.A.
and Wallach, Dan
and Brenner, Michael
and Rohloff, Kurt",
title="On Scaling Decentralized Blockchains",
booktitle="Financial Cryptography and Data Security",
year="2016",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="106--125",
abstract="The increasing popularity of blockchain-based cryptocurrencies has made scalability a primary and urgent concern. We analyze how fundamental and circumstantial bottlenecks in Bitcoin limit the ability of its current peer-to-peer overlay network to support substantially higher throughputs and lower latencies. Our results suggest that reparameterization of block size and intervals should be viewed only as a first increment toward achieving next-generation, high-load blockchain protocols, and major advances will additionally require a basic rethinking of technical approaches. We offer a structured perspective on the design space for such approaches. Within this perspective, we enumerate and briefly discuss a number of recently proposed protocol ideas and offer several new ideas and open challenges.",
isbn="978-3-662-53357-4"
}

@Misc{segwit,
  author = {Bitcoin},
  title  = {BIP141 --- Bitcoin Improvement Proposals},
  year   = {2018},
  note   = {[Online; accessed 2018]},
  url    = {https://github.com/bitcoin/bips/},
}

@Misc{datum,
  author = {Datum Network GmbH},
  title  = {Datum},
  year   = {2017},
  url    = {https://datum.org/},
}

@Misc{dawex,
  author = {Dawex Systems},
  title  = {Dawex},
  year   = {2018},
  url    = {https://www.dawex.com/},
}

@Misc{q_dx,
  author = {q Data Exchange},
  title  = {q Data Exchange},
  year   = {2018},
  url    = {https://www.q-dx.com/},
}

@Misc{datastreamx,
  author = {DataStreamX Pte Ltd},
  title  = {DataStreamX},
  year   = {2018},
  url    = {https://www.datastreamx.com/},
}

@article{pr_data_cost_1,
 author  = {Sophie Curtis},
 date    = {2015-11-23},
 title   = {How much is your personal data worth?},
 journal = {The Telegraph},
 url     = {https://www.telegraph.co.uk/technology/news/12012191/How-much-is-your-personal-data-worth.html},
 urldate = {2015-11-23}
}

@article{pr_data_cost_2,
 author  = {Emily Steel, Callum Locke, Emily Cadman and Ben Freese},
 date    = {2013-06-12},
 title   = {How much is your personal data worth?},
 journal = {Financial Times},
 url     = {https://ig.ft.com/how-much-is-your-personal-data-worth/},
 urldate = {2013-06-12}
}

@article{pr_data_cost_3,
 author  = {Billy Ehrenberg},
 date    = {2014-04-22},
 title   = {How much is your personal data worth?},
 journal = {The Guardian},
 url     = {https://www.theguardian.com/news/datablog/2014/apr/22/how-much-is-personal-data-worth},
 urldate = {2014-04-22}
}

@TechReport{bl_auditability,
  author      = {Bitfury Group},
  title       = {On Blockchain Auditability},
  institution = {Bitfury Group},
  year        = {2016},
  url         = {http://bitfury.com/content/5-white-papers-research/bitfury_white_paper_on_blockchain_auditability.pdf}
}

@article{non_repudiation,
  title={Non-repudiation in the digital environment},
  author={McCullagh, Adrian and Caelli, William},
  journal={First Monday},
  volume={5},
  number={8},
  year={2000},
  publisher={Valauskas, Edward J.}
}

@InProceedings{10.1007/978-3-540-46588-1_20,
  author="Buldas, Ahto
  and Lipmaa, Helger
  and Schoenmakers, Berry",
  editor="Imai, Hideki
  and Zheng, Yuliang",
  title="Optimally Efficient Accountable Time-Stamping",
  booktitle="Public Key Cryptography",
  year="2000",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  pages="293--305",
  abstract="Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable if if it makes the TSA and other authorities accountable for their actions by enabling a principal to detect and later prove to a judge any frauds, including attempts to reorder time-stamps from the same round. We investigate the paradigm of time-stamping services based on simply connected graphs, and propose a simple, yet optimal, accountable time-stamping service, using what we call threaded tree schemes. We improve upon the previously best scheme by Buldas and Laud by reducing the size of a time stamp by a factor of about 3.786 and show that our construction is optimal in a strict sense. The new protocols also increase the trustworthiness of the publication process, which takes place at the end of each round.",
  isbn="978-3-540-46588-1"
}

@book{mpc,
  doi = {10.1007/978-3-642-14303-8},
  url = {https://doi.org/10.1007/978-3-642-14303-8},
  year  = {2010},
  publisher = {Springer Berlin Heidelberg},
  author = {Carmit Hazay and Yehuda Lindell},
  title = {Efficient Secure Two-Party Protocols},
  isbn = {3642143024, 9783642143021},
  edition = {1st},
  address = {New York, NY, USA},
}

@book{Kamm:2015:ASM:2836836,
 author = {Kamm, P. and Laud, L.},
 title = {Applications of Secure Multiparty Computation},
 year = {2015},
 isbn = {1614995311, 9781614995319},
 publisher = {IOS Press},
 address = {Amsterdam, The Netherlands, The Netherlands},
}

@inproceedings{Yao:1982:PSC:1398511.1382751,
 author = {Yao, Andrew C.},
 title = {Protocols for Secure Computations},
 booktitle = {Proceedings of the 23rd Annual Symposium on Foundations of Computer Science},
 series = {SFCS '82},
 year = {1982},
 pages = {160--164},
 numpages = {5},
 url = {http://dx.doi.org/10.1109/SFCS.1982.88},
 doi = {10.1109/SFCS.1982.88},
 acmid = {1382751},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
}

@INPROCEEDINGS{mpc_ioannidis,
author={I. Ioannidis and A. Grama},
booktitle={36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the},
title={An efficient protocol for Yao's millionaires' problem},
year={2003},
volume={},
number={},
pages={6 pp.-},
keywords={Internet;data mining;electronic commerce;optimisation;protocols;public key cryptography;security of data;Internet;Yao millionaires problem;association rule mining;communication overhead;cryptanalysis;data communication;dot products;e-commerce;item-set generation;less-or-equal predicate;online auctions;online bidding;optimal solution;public-key cryptography;secure multiparty computation;secure protocol;time overhead;Arithmetic;Association rules;Cryptographic protocols;Data mining;International trade;Internet;Partitioning algorithms;Pricing;Protection;Public key cryptography},
doi={10.1109/HICSS.2003.1174464},
ISSN={},
month={Jan},}

@inproceedings{Ben-Or:1988:CTN:62212.62213,
 author = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi},
 title = {Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation},
 booktitle = {Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing},
 series = {STOC '88},
 year = {1988},
 isbn = {0-89791-264-0},
 location = {Chicago, Illinois, USA},
 pages = {1--10},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/62212.62213},
 doi = {10.1145/62212.62213},
 acmid = {62213},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@book{Katz:2014:IMC:2700550,
 author = {Katz, Jonathan and Lindell, Yehuda},
 title = {Introduction to Modern Cryptography, Second Edition},
 year = {2014},
 isbn = {1466570261, 9781466570269},
 edition = {2nd},
 publisher = {Chapman \& Hall/CRC},
}

@article{Diffie:2006:NDC:2263321.2269104,
 author = {Diffie, W. and Hellman, M.},
 title = {New Directions in Cryptography},
 journal = {IEEE Trans. Inf. Theor.},
 issue_date = {November 1976},
 volume = {22},
 number = {6},
 month = sep,
 year = {2006},
 issn = {0018-9448},
 pages = {644--654},
 numpages = {11},
 url = {http://dx.doi.org/10.1109/TIT.1976.1055638},
 doi = {10.1109/TIT.1976.1055638},
 acmid = {2269104},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
}

@article{rsa,
 author = {Rivest, R. L. and Shamir, A. and Adleman, L.},
 title = {A Method for Obtaining Digital Signatures and Public-key Cryptosystems},
 journal = {Commun. ACM},
 issue_date = {Feb. 1978},
 volume = {21},
 number = {2},
 month = feb,
 year = {1978},
 issn = {0001-0782},
 pages = {120--126},
 numpages = {7},
 url = {http://doi.acm.org/10.1145/359340.359342},
 doi = {10.1145/359340.359342},
 publisher = {ACM},
 acmid = {359342},
 address = {New York, NY, USA},
 keywords = {authentication, cryptography, digital signatures, electronic funds transfer, electronic mail, factorization, message-passing, prime number, privacy, public-key cryptosystems, security},
}

@ARTICLE{el_gamal,
author={T. Elgamal},
journal={IEEE Transactions on Information Theory},
title={A public key cryptosystem and a signature scheme based on discrete logarithms},
year={1985},
volume={31},
number={4},
pages={469-472},
keywords={Cryptography;Logarithmic arithmetic;Digital signatures;Galois fields;Helium;Information security;Information systems;Milling machines;Public key;Public key cryptography},
doi={10.1109/TIT.1985.1057074},
ISSN={0018-9448},
month={Jul},}

@Unpublished{crypto_101,
  author      = {Laurens Van Houtven (lvh)},
  title       = {Crypto 101},
  year        = {2017},
  note={\url{https://www.crypto101.io/}}
}

@Unpublished{boneh_crypto,
  title     = {A Graduate Course in Applied Cryptography},
  note={\url{https://crypto.stanford.edu/~dabo/pubs/abstracts/bookShoup.html}},
  year      = {2017},
  author    = {Boneh, Dan and Shoup, Victor},
}

@book{elliptic_curves,
  title={Elliptic Curves: Number Theory and Cryptography},
  author={Washington, L.C.},
  isbn={9780203484029},
  lccn={2003043972},
  series={Discrete Mathematics and Its Applications},
  url={https://books.google.com/books?id=vPL19KNdm2wC},
  year={2003},
  publisher={CRC Press}
}

@book{elliptic_curves_2,
  title={Guide to Elliptic Curve Cryptography},
  author={Hankerson, D. and Menezes, A.J. and Vanstone, S.},
  isbn={9780387218465},
  lccn={2003059137},
  series={Springer Professional Computing},
  url={https://books.google.co.ve/books?id=V5oACAAAQBAJ},
  year={2006},
  publisher={Springer New York}
}

@InProceedings{ecc_rsa_bits,
author="Lenstra, Arjen K.
and Verheul, Eric R.",
editor="Imai, Hideki
and Zheng, Yuliang",
title="Selecting Cryptographic Key Sizes",
booktitle="Public Key Cryptography",
year="2000",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="446--465",
abstract="In this article we give guidelines for the determination of cryptographic key sizes. Our recommendations are based on a set of explicitly formulated hypotheses, combined with existing data points about the cryptosystems. This article is an abbreviated version of [15].",
isbn="978-3-540-46588-1"
}

@INPROCEEDINGS{ecc_rsa_bits_1,
author={N. Thiranant and Y. S. Lee and H. Lee},
booktitle={2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops},
title={Performance Comparison Between RSA and Elliptic Curve Cryptography-Based QR Code Authentication},
year={2015},
volume={},
number={},
pages={278-282},
keywords={codes;public key cryptography;smart phones;QR code authentication technique;RSA;elliptic curve cryptography-based QR code authentication;internet;multifactor authentication;smartphone;Authentication;Elliptic curve cryptography;Elliptic curves;Encryption;Data encryption;Elliptic Curve Cryptography;Mobile application;Public-key algorithm;QR Code},
doi={10.1109/WAINA.2015.62},
ISSN={},
month={March},}

@book{blake1999elliptic,
  title={Elliptic Curves in Cryptography},
  author={Blake, I. and Seroussi, G. and Smart, N. and Eugene Spafford Collection and London Mathematical Society and Hitchin, N.J.},
  isbn={9780521653749},
  lccn={99019696},
  series={Lecture note series},
  url={https://books.google.co.ve/books?id=0\_vegzgyqGMC},
  year={1999},
  publisher={Cambridge University Press}
}

@article{shannon_otp,
author = {C. E. Shannon},
title = {Communication Theory of Secrecy Systems*},
journal = {Bell System Technical Journal},
volume = {28},
number = {4},
pages = {656-715},
doi = {10.1002/j.1538-7305.1949.tb00928.x},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/j.1538-7305.1949.tb00928.x},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/j.1538-7305.1949.tb00928.x}
}

@article{dsa,
  title={The Digital Signature Algorithm (DSA)},
  author={Buchmann, Johannes},
  year={2001}
}

@article{dsa_nist,
  title={Digital signature standard (dss)},
  author={Gallagher, Patrick},
  journal={Federal Information Processing Standards Publications, volume FIPS},
  pages={186--3},
  year={2013}
}

@Inbook{salsa20,
author="Bernstein, Daniel J.",
editor="Robshaw, Matthew
and Billet, Olivier",
title="The Salsa20 Family of Stream Ciphers",
bookTitle="New Stream Cipher Designs: The eSTREAM Finalists",
year="2008",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="84--97",
abstract="Salsa20 is a family of 256-bit stream ciphers designed in 2005 and submitted to eSTREAM, the ECRYPT Stream Cipher Project. Salsa20 has progressed to the third round of eSTREAM without any changes. The 20-round stream cipher Salsa20/20 is consistently faster than AES and is recommended by the designer for typical cryptographic applications. The reduced-round ciphers Salsa20/12 and Salsa20/8 are among the fastest 256-bit stream ciphers available and are recommended for applications where speed is more important than confidence. The fastest known attacks use ≈{\thinspace}2153 simple operations against Salsa20/7, ≈{\thinspace}2249 simple operations against Salsa20/8, and ≈{\thinspace}2255 simple operations against Salsa20/9, Salsa20/10, etc. In this paper, the Salsa20 designer presents Salsa20 and discusses the decisions made in the Salsa20 design.",
isbn="978-3-540-68351-3",
doi="10.1007/978-3-540-68351-3_8",
url="https://doi.org/10.1007/978-3-540-68351-3_8"
}

@article{chacha,
  title={The ChaCha family of stream ciphers},
  author={Bernstein, Daniel J},
  journal={DJ Bernstein's Webpage}
}

@article{ethereum_whitepaper,
  title={A next-generation smart contract and decentralized application platform},
  author={Buterin, Vitalik and others},
  journal={white paper},
  year={2014}
}

@article{ecdsa,
  title={The elliptic curve digital signature algorithm (ECDSA)},
  author={Johnson, Don and Menezes, Alfred and Vanstone, Scott},
  journal={International journal of information security},
  volume={1},
  number={1},
  pages={36--63},
  year={2001},
  publisher={Springer}
}

@misc{secp,
  title={SEC 2: Recommended Elliptic Curve Domain Parameters},
  author={Qu, Minghua},
  year={1999}
}

@inproceedings{padding_attacks,
  title={Security Flaws Induced by CBC Padding—Applications to SSL, IPSEC, WTLS...},
  author={Vaudenay, Serge},
  booktitle={International Conference on the Theory and Applications of Cryptographic Techniques},
  pages={534--545},
  year={2002},
  organization={Springer}
}

@article{malleability,
  title={Nonmalleable cryptography},
  author={Dolev, Danny and Dwork, Cynthia and Naor, Moni},
  journal={SIAM review},
  volume={45},
  number={4},
  pages={727--784},
  year={2003},
  publisher={SIAM}
}

@inproceedings{double_spent,
  title={Double-spending fast payments in bitcoin},
  author={Karame, Ghassan O and Androulaki, Elli and Capkun, Srdjan},
  booktitle={Proceedings of the 2012 ACM conference on Computer and communications security},
  pages={906--917},
  year={2012},
  organization={ACM}
}

@article{zindros_thesis,
  title={Trust in decentralized anonymous marketplaces},
  author={Zindros, Dionysios},
  notes={\url{http://dspace.lib.ntua.gr/handle/123456789/43147}},
  url={http://dspace.lib.ntua.gr/handle/123456789/43147},
  year={2016}
}

@TechReport{eth_design,
  author      = {Ethereum foundation},
  title       = {Design Rationale},
  year        = {2018},
  url         = {https://github.com/ethereum/wiki/wiki/Design-Rationale},
}

@inproceedings{safe_smart_contracts,
  title={Step by step towards creating a safe smart contract: Lessons and insights from a cryptocurrency lab},
  author={Delmolino, Kevin and Arnett, Mitchell and Kosba, Ahmed and Miller, Andrew and Shi, Elaine},
  booktitle={International Conference on Financial Cryptography and Data Security},
  pages={79--94},
  year={2016},
  organization={Springer}
}

@inproceedings{smart_contracts_smarter,
  title={Making smart contracts smarter},
  author={Luu, Loi and Chu, Duc-Hiep and Olickel, Hrishi and Saxena, Prateek and Hobor, Aquinas},
  booktitle={Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security},
  pages={254--269},
  year={2016},
  organization={ACM}
}

@misc{dao,
	title = {Analysis of the {DAO} exploit},
	url = {http://hackingdistributed.com/2016/06/18/analysis-of-the-dao-exploit/},
	urldate = {2018-05-03},
  author = {Daian, Phil},
	journal = {Hacking Distributed}
}

@misc{dao_2,
	title = {The{DAO} smart contract},
  note={\url{https://etherscan.io/address/0xbb9bc244d798123fde783fcc1c72d3bb8c189413#code}},
	url = {https://etherscan.io/address/0xbb9bc244d798123fde783fcc1c72d3bb8c189413#code}
}

@article{zksnark_basics,
  title={zk-SNARK explained: Basic Principles},
  author={Mayer, Hartwig},
  year={2016}
}

@inproceedings{schneier1997improved,
  title={An improved e-mail security protocol},
  author={Schneier, Bruce and Hall, Chris},
  booktitle={Computer Security Applications Conference, 1997. Proceedings., 13th Annual},
  pages={227--230},
  year={1997},
  organization={IEEE}
}

@article{groth2014cryptography,
  title={Cryptography in the multi-string model},
  author={Groth, Jens and Ostrovsky, Rafail},
  journal={Journal of Cryptology},
  volume={27},
  number={3},
  pages={506--543},
  year={2014},
  publisher={Springer}
}

@techreport{zcash_mpc,
  title={A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK},
  author={Bowe, Sean and Gabizon, Ariel and Green, Matthew D},
  year={2017},
  institution={TR 2017/602, IACR}
}

@inproceedings{dalvi2004adversarial,
  title={Adversarial classification},
  author={Dalvi, Nilesh and Domingos, Pedro and Sanghai, Sumit and Verma, Deepak and others},
  booktitle={Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining},
  pages={99--108},
  year={2004},
  organization={ACM}
}

@article{sabour2015adversarial,
  title={Adversarial manipulation of deep representations},
  author={Sabour, Sara and Cao, Yanshuai and Faghri, Fartash and Fleet, David J},
  journal={arXiv preprint arXiv:1511.05122},
  year={2015}
}

@inproceedings{trust_is_risk,
  title={Trust is risk: a decentralized financial trust platform},
  author={Litos, Orfeas Stefanos Thyfronitis and Zindros, Dionysis},
  booktitle={International Conference on Financial Cryptography and Data Security},
  pages={340--356},
  year={2017},
  organization={Springer}
}

@inproceedings{sybil_attack,
  title={The sybil attack},
  author={Douceur, John R},
  booktitle={International workshop on peer-to-peer systems},
  pages={251--260},
  year={2002},
  organization={Springer}
}

@Misc{zcash_snarks,
  author = {zcash},
  title  = {What are zk-SNARKs?},
  note   = {[Online; accessed 2018]},
  url    = {https://z.cash/technology/zksnarks.html},
}

@article{open_data_1,
  title={De-identification methods for open health data: the case of the Heritage Health Prize claims dataset},
  author={El Emam, Khaled and Arbuckle, Luk and Koru, Gunes and Eze, Benjamin and Gaudette, Lisa and Neri, Emilio and Rose, Sean and Howard, Jeremy and Gluck, Jonathan},
  journal={Journal of medical Internet research},
  volume={14},
  number={1},
  year={2012},
  publisher={JMIR Publications Inc.}
}

@inproceedings{zql,
  title={ZQL: A Compiler for Privacy-Preserving Data Processing.},
  author={Fournet, C{\'e}dric and Kohlweiss, Markulf and Danezis, George and Luo, Zhengqin and others},
  booktitle={USENIX Security Symposium},
  pages={163--178},
  year={2013}
}

@inproceedings{differential_privacy,
  title={Differential privacy: A survey of results},
  author={Dwork, Cynthia},
  booktitle={International Conference on Theory and Applications of Models of Computation},
  pages={1--19},
  year={2008},
  organization={Springer}
}

@book{kerckhoffs_principles,
  title={La cryptographie militaire, ou, Des chiffres usit{\'e}s en temps de guerre: avec un nouveau proc{\'e}d{\'e} de d{\'e}chiffrement applicable aux syst{\`e}mes {\`a} double clef},
  author={Kerckhoffs, Auguste},
  year={1883},
  publisher={Librairie militaire de L. Baudoin}
}

@Misc{mhmd,
  author = {MHMD},
  title  = {My Health My Data (MHMD)},
  year   = {2018},
  note   = {[Online; accessed 2018]},
  url    = {http://www.myhealthmydata.eu/},
}

@article{big_data,
  title={Introduction to the big data era},
  author={Kudyba, Stephan and Kwatinetz, Matthew},
  journal={Big Data, Mining, and Analytics},
  pages={1--17},
  year={2014}
}

@Misc{metamask,
  author = {Metamask},
  url    = {https://metamask.io/},
  note = {\url{https://metamask.io/}},
}

@Misc{wiki:open_data,
  author = {Wikipedia},
  title  = {Open data --- {W}ikipedia{,} The Free Encyclopedia},
  year   = {2017},
  note   = {[Online; accessed 12-January-2018]},
  url    = {https://en.wikipedia.org/wiki/Open_data},
}

repository: cnasikas/thesis

repo_name: cnasikas/thesis


text:
@ARTICLE{10.3389/fclim.2021.686440,
    author={Jackson Hammond, Angelyca A. and Motew, Melissa and Brummitt, Charles D. and DuBuisson, Max L. and Pinjuv, Guy and Harburg, Daniel V. and Campbell, Eleanor E. and Kumar, Ashok A.},
    title={Implementing the Soil Enrichment Protocol at Scale: Opportunities for an Agricultural Carbon Market},
    journal={Frontiers in Climate},
    volume={3},
    year={2021},
    url={https://www.frontiersin.org/articles/10.3389/fclim.2021.686440},
    doi={10.3389/fclim.2021.686440},
    issn={2624-9553},
    abstract={High-quality agricultural carbon credits that incentivize regenerative practices can help address climate change through greenhouse gas (GHG) abatement and CO2 sequestration. Generating large volumes of such credits requires rigorous crediting methodologies. The Soil Enrichment Protocol (SEP) by the Climate Action Reserve (CAR) aims to unlock this type of crediting potential. The SEP includes new expert-driven standards for validating the use of soil biogeochemical modeling to generate credits. Technical experts at Indigo Ag participated in the SEP working group and are supporting implementation of the first project, CAR 1459_RP1, on hundreds of thousands of acres in the US. The authors share their thoughts on new approaches enabled by the SEP as both contributors to the theory behind and practitioners of these approaches. The SEP enables scalable, high-quality credits through four main advances: (1) allowing flexibility in the use of biogeochemical models that meet explicit performance requirements, (2) enabling a new approach to field-level, modeled baselines, (3) supporting a hybrid approach of credit generation using both soil measurement and modeling, and (4) requiring a new type of credit uncertainty quantification that accounts for multiple sources of uncertainty. Together these advances support agricultural credit quantification that enables payments to offset transitional costs for growers, at large enough scales to create a robust market, with a level of rigor that ensures any credited emission reductions have real climate impact. Innovations in soil analyses, advances in research, and improvements in data collection could further improve the potential for agricultural carbon credits to scale.}
}

license: MIT

repository: cbrummitt/academic-kickstart

license_type: permissive

repo_name: cbrummitt/academic-kickstart

branch_name: refs/heads/master

gha_license_id: MIT

gha_language: Shell

extension: bib


text:
@ARTICLE{Carroll2015-wq,
  title    = "Sharing Research Data and Intellectual Property Law: A Primer",
  author   = "Carroll, Michael W",
  journal  = "PLoS biology",
  volume   =  13,
  number   =  8,
  pages    = "e1002235",
  month    =  aug,
  year     =  2015,
  url      = "http://dx.doi.org/10.1371/journal.pbio.1002235",
  language = "en",
  issn     = "1544-9173, 1545-7885",
  pmid     = "26313685",
  doi      = "10.1371/journal.pbio.1002235",
  pmc      = "PMC4551669"
}


text:
.photo {
    padding: 5% 0 5% 0;
    width: 80%;
    margin: auto;
}

.employeeSelection {
    cursor: pointer;
    background-color: #56baed;
    border: none;
    color: white;
    padding: 15px 80px;
    text-align: center;
    text-decoration: none;
    display: inline-block;
    text-transform: uppercase;
    font-size: 13px;
    -webkit-box-shadow: 0 10px 30px 0 rgba(95,186,233,0.4);
    box-shadow: 0 10px 30px 0 rgba(95,186,233,0.4);
    -webkit-border-radius: 5px 5px 5px 5px;
    border-radius: 5px 5px 5px 5px;
    margin: 5px 20px 40px 20px;
    -webkit-transition: all 0.3s ease-in-out;
    -moz-transition: all 0.3s ease-in-out;
    -ms-transition: all 0.3s ease-in-out;
    -o-transition: all 0.3s ease-in-out;
    transition: all 0.3s ease-in-out;
    width: 80%;
    text-align: center;
    padding-right: 5%;
    padding-left: 5%;
    margin-bottom: 5px;
    max-width: 214.91px;
}

.employeeSelection:active {

    width: 80%;
    text-align: center;
    padding-right: 15%;
    padding-left: 15%;
    margin-bottom: 5px;
    max-width: 214.91px;
}

repository: cqm-quality-center/nonconformity

repo_name: cqm-quality-center/nonconformity

gha_language: TypeScript

extension: css


text:
@article{richardson_effect_1998,
 author = {Richardson, A. J. and Mitchell-Innes, B. A. and Fowler, J. L. and Bloomer, S. F. and Verheye, H. M. and Field, J. G. and Hutchings, L. and Painting, S. J.},
 doi = {10.2989/025776198784126755},
 file = {Richardson et al. - 1998 - The effect of sea temperature and food availabilit.pdf:/Users/ric325/Zotero/storage/HKLPWIES/Richardson et al. - 1998 - The effect of sea temperature and food availabilit.pdf:application/pdf},
 issn = {0257-7615},
 journal = {South African Journal of Marine Science},
 language = {en},
 month = {June},
 number = {1},
 pages = {275--290},
 title = {The effect of sea temperature and food availability on the spawning success of Cape anchovy \textitEngraulis capensis in the southern Benguela},
 url = {http://www.tandfonline.com/doi/abs/10.2989/025776198784126755},
 urldate = {2019-10-24},
 volume = {19},
 year = {1998}
}


text:
@article{allein2021time,
title={{Time-Aware Evidence Ranking for Fact-Checking}},
author={Liesbeth Allein and Isabelle Augenstein and Marie-Francine Moens},
year={2021},
journal = {Web Semantics}
}

repository: copenlu/academic-kickstart

repo_name: copenlu/academic-kickstart

gha_language: TeX


text:
####################################################################
# COMMON FLAGS
####################################################################
set( CMAKE_Fortran_FLAGS "${CMAKE_Fortran_FLAGS} ")

####################################################################
# RELEASE FLAGS
####################################################################

set( CMAKE_Fortran_FLAGS_RELEASE "-O3 -mp")

####################################################################
# DEBUG FLAGS
####################################################################

set( CMAKE_Fortran_FLAGS_DEBUG "${CMAKE_Fortran_FLAGS_DEBUG} -O0 -g" )

####################################################################
# FLAGS FOR GPU
####################################################################

#set( Fortran_GPU_FLAGS        "-acc -Minfo=accel -ta=tesla:cc60,cuda11.2" )
set( Fortran_GPU_FLAGS        "" )

repository: robgpita-noaa/SENA-crtm

repo_name: robgpita-noaa/SENA-crtm

extension: cmake