ref.bib (10113B)
1 2 3 @misc{miller2014tls, 4 author = {Brad Miller and Ling Huang and A.D. Joseph and J.D. Tygar}, 5 title = {I Know Why You Went to the Clinic: Risks and Realization of HTTPS Traffic Analysis}, 6 year = {2014}, 7 howpublished = {\url{http://arxiv.org/abs/1403.0297}} 8 } 9 10 @article{crowds, 11 author = {Reiter, Michael K. and Rubin, Aviel D.}, 12 title = {Anonymous Web transactions with Crowds}, 13 journal = {Commun. ACM}, 14 issue_date = {Feb. 1999}, 15 volume = {42}, 16 number = {2}, 17 month = feb, 18 year = {1999}, 19 issn = {0001-0782}, 20 pages = {32--48}, 21 numpages = {17}, 22 } 23 24 @inproceedings{tor2004, 25 author = {Dingledine, Roger and Mathewson, Nick and Syverson, Paul}, 26 title = {Tor: the second-generation onion router}, 27 year = {2004}, 28 publisher = {USENIX Association}, 29 address = {USA}, 30 abstract = {We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability, and efficiency. We briefly describe our experiences with an international network of more than 30 nodes. We close with a list of open problems in anonymous communication.}, 31 booktitle = {Proceedings of the 13th Conference on USENIX Security Symposium - Volume 13}, 32 pages = {21}, 33 numpages = {1}, 34 location = {San Diego, CA}, 35 series = {SSYM'04} 36 } 37 38 39 40 41 42 @inproceedings{mixminion, 43 author = {Danezis, George and Dingledine, Roger and Mathewson, Nick}, 44 title = {Mixminion: Design of a Type III Anonymous Remailer Protocol}, 45 booktitle = {Proceedings of the 2003 IEEE Symposium on Security and Privacy}, 46 series = {SP '03}, 47 year = {2003}, 48 isbn = {0-7695-1940-7}, 49 } 50 51 @inproceedings{ gap, 52 author = "Krista Bennett and Christian Grothoff", 53 title = "{gap - Practical Anonymous Networking}", 54 booktitle = "Designing Privacy Enhancing Technologies", 55 publisher = "Springer-Verlag", 56 pages = "141--160", 57 url = "http://grothoff.org/christian/aff.pdf", 58 year = "2003" 59 } 60 61 @article{gilbertCAP2002, 62 author = {Gilbert, Seth and Lynch, Nancy}, 63 title = {Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-tolerant Web Services}, 64 journal = {SIGACT News}, 65 issue_date = {June 2002}, 66 volume = {33}, 67 number = {2}, 68 month = jun, 69 year = {2002}, 70 issn = {0163-5700}, 71 pages = {51--59}, 72 numpages = {9}, 73 url = {http://doi.acm.org/10.1145/564585.564601}, 74 doi = {10.1145/564585.564601}, 75 acmid = {564601}, 76 publisher = {ACM}, 77 address = {New York, NY, USA}, 78 } 79 80 81 @INPROCEEDINGS{bls, 82 author = {Dan Boneh and Ben Lynn and Hovav Shacham}, 83 title = {Short signatures from the Weil pairing}, 84 booktitle = {Advances in Cryptology – ASIACRYPT ’01, LNCS}, 85 year = {2001}, 86 pages = {514--532}, 87 publisher = {Springer} 88 } 89 90 @INPROCEEDINGS{polkadot, 91 author={Abbas, Hanaa and Caprolu, Maurantonio and Di Pietro, Roberto}, 92 booktitle={2022 IEEE International Conference on Blockchain (Blockchain)}, 93 title={Analysis of Polkadot: Architecture, Internals, and Contradictions}, 94 year={2022}, 95 volume={}, 96 number={}, 97 pages={61-70}, 98 } 99 100 101 @article{zfone, 102 author = {Laurianne McLaughlin}, 103 title = {Philip Zimmermann on What's Next after PGP}, 104 journal ={IEEE Security \& Privacy}, 105 volume = {4}, 106 number = {1}, 107 issn = {1540-7993}, 108 year = {2006}, 109 pages = {10-13}, 110 } 111 112 @inproceedings{sybil, 113 title = {{The Sybil Attack}}, 114 author = {John Douceur}, 115 booktitle = {Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 116 2002)}, 117 year = {2002}, 118 month = {March}, 119 } 120 121 @inproceedings{timing-fc2004, 122 title = {Timing Attacks in Low-Latency Mix-Based Systems}, 123 author = {Brian N. Levine and Michael K. Reiter and Chenxi Wang and Matthew K. Wright}, 124 booktitle = {Proceedings of Financial Cryptography (FC '04)}, 125 year = {2004}, 126 month = {February}, 127 pages = {251--265}, 128 } 129 130 @InCollection{ cbdc2021chaum, 131 author = {David Chaum and Christian Grothoff and Thomas Moser}, 132 title = {How to Issue a Central Bank Digital Currency}, 133 booktitle = {SNB Working Papers}, 134 publisher = {Swiss National Bank}, 135 year = {2021}, 136 number = {2021-3}, 137 month = {February}, 138 } 139 140 141 @TechReport{frost, 142 author = {Deirdre Connolly and Chelsea Komlo and Ian Goldberg and Christopher A. Wood}, 143 title = {Two-Round Threshold Schnorr Signatures with FROST }, 144 institution = {IRTF}, 145 year = {2023}, 146 note = {\url{https://datatracker.ietf.org/doc/draft-irtf-cfrg-frost/}}, 147 } 148 149 @InProceedings{esorics2022age, 150 author = {Kesim, {\"O}zg{\"u}r and Grothoff, Christian and 151 Dold, Florian and Schanzenbach, Martin}, 152 editor = {Atluri, Vijayalakshmi and Di Pietro, Roberto and 153 Jensen, Christian D. and Meng, Weizhi}, 154 title = {{Zero-Knowledge Age Restriction for {GNU Taler}}}, 155 booktitle = {Computer Security -- ESORICS 2022}, 156 year = {2022}, 157 publisher = {Springer International Publishing}, 158 address = {Cham}, 159 pages = {110--129}, 160 isbn = {978-3-031-17140-6}, 161 howpublished = {\url{https://link.springer.com/chapter/10.1007/978-3-031-17140-6_6}}, 162 } 163 164 @MastersThesis{anastasis, 165 author = {Dominik Samuel Meister and Dennis Neufeld}, 166 title = {Anastasis: Password-less key recovery via multi-factor multi-party authentication}, 167 school = {Bern University of Applied Sciences}, 168 year = {2020}, 169 month = {June}, 170 } 171 172 @phdthesis{DBLP:phd/hal/Dold19, 173 author = {Florian Dold}, 174 title = {The {GNU} Taler system: practical and provably secure electronic payments. 175 (Le syst{\`{e}}me {GNU} Taler: Paiements {\'{e}}lectroniques 176 pratiques et s{\'{e}}curis{\'{e}}s)}, 177 school = {University of Rennes 1, France}, 178 year = {2019}, 179 url = {https://tel.archives-ouvertes.fr/tel-02138082}, 180 timestamp = {Tue, 21 Jul 2020 00:40:38 +0200}, 181 biburl = {https://dblp.org/rec/phd/hal/Dold19.bib}, 182 bibsource = {dblp computer science bibliography, https://dblp.org} 183 } 184 185 186 @InProceedings{taler2016space, 187 author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}, 188 title = {Enabling Secure Web Payments with {{GNU Taler}}}, 189 booktitle = {6th International Conference on Security, Privacy and Applied Cryptographic Engineering}, 190 year = {2016}, 191 editor = {Claude Carlet and M. Anwar Hasan and Vishal Saraswat}, 192 number = {10076}, 193 series = {LNCS}, 194 pages = {251-270}, 195 month = {Dec}, 196 publisher = {Springer}, 197 } 198 @InProceedings{10.1007/3-540-48910-X_16, 199 author="Paillier, Pascal", 200 editor="Stern, Jacques", 201 title="Public-Key Cryptosystems Based on Composite Degree Residuosity Classes", 202 booktitle="Advances in Cryptology --- EUROCRYPT '99", 203 year="1999", 204 publisher="Springer Berlin Heidelberg", 205 address="Berlin, Heidelberg", 206 pages="223--238", 207 abstract="This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.", 208 isbn="978-3-540-48910-8" 209 } 210 211 @TechReport{smcgeo, 212 author = {Mikhail J. Atallah and Wenliang Du}, 213 title = {Secure Multi-Party Computational Geometry}, 214 institution = {Purdue University}, 215 year = {2001}, 216 number = {2001-48}, 217 address = {West Lafayette, IN 47907}, 218 } 219 220 @inproceedings{IoannidisGA02, 221 author = {Ioannis Ioannidis and 222 Ananth Grama and 223 Mikhail J. Atallah}, 224 title = {A Secure Protocol for Computing Dot-Products in Clustered and Distributed 225 Environments}, 226 booktitle = {31st International Conference on Parallel Processing {(ICPP} 2002), 227 20-23 August 2002, Vancouver, BC, Canada}, 228 pages = {379--384}, 229 publisher = {{IEEE} Computer Society}, 230 year = {2002}, 231 url = {https://doi.org/10.1109/ICPP.2002.1040894}, 232 doi = {10.1109/ICPP.2002.1040894}, 233 timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}, 234 biburl = {https://dblp.org/rec/conf/icpp/IoannidisGA02.bib}, 235 bibsource = {dblp computer science bibliography, https://dblp.org} 236 } 237 238 @INPROCEEDINGS{Amirbekyan_anew, 239 author = {Artak Amirbekyan and Vladimir Estivill-castro}, 240 title = {A new efficient privacypreserving scalar product protocol}, 241 booktitle = {in Proc. of AusDM ’07}, 242 year = {}, 243 pages = {209--214} 244 } 245 246 @Inbook{Chaum1984, 247 author="Chaum, David", 248 title="Blind Signature System", 249 bookTitle="Advances in Cryptology: Proceedings of Crypto 83", 250 year="1984", 251 publisher="Springer US", 252 address="Boston, MA", 253 pages="153--153", 254 abstract="An untraceable payments system based on an extension of public key cryptography, called blind signatures, has been presented previously by the author. The existence of such blind signature systems was not demonstrated. An actual set of implementable functions is presented in the present work which have the blind signature property, and for which the blindness of the signature is proved without any assumptions about computational infeasibility. In terms of the simple payments system previously presented, this means that even a conspiracy between the bank and payee can learn nothing from their participation in the payments protocol about the identity of the payer.", 255 isbn="978-1-4684-4730-9", 256 doi="10.1007/978-1-4684-4730-9_14", 257 url="https://doi.org/10.1007/978-1-4684-4730-9_14" 258 }