marketing

Marketing materials (presentations, posters, flyers)
Log | Files | Refs

extra.bib (4321B)

      1 @Article{suerf2023huang,
      2   author =       {Priscilla Huang and Emmanuel Benoist and Christian Grothoff and Sebastian Javier Marchano},
      3   title =        {Practical Offline Payments Using One-Time Passcodes},
      4   journal =      {SUERF Policy Briefs},
      5   year =         {2023},
      6 }
      7 %  number =    {TBD},
      8 %  month =     {June},
      9 
     10 
     11 @InCollection{ cbdc2021chaum,
     12   author =       {David Chaum and Christian Grothoff and Thomas Moser},
     13   title =        {How to Issue a Central Bank Digital Currency},
     14   booktitle =    {SNB Working Papers},
     15   publisher =    {Swiss National Bank},
     16   year =         {2021},
     17   number =       {2021-3},
     18   month =        {February},
     19 }
     20 @InProceedings{taler2016space,
     21   author =       {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci},
     22   title =        {Enabling Secure Web Payments with {{GNU Taler}}},
     23   booktitle = {6th International Conference on Security, Privacy and Applied Cryptographic Engineering},
     24   year =      {2016},
     25   editor =    {Claude Carlet and M. Anwar Hasan and Vishal Saraswat},
     26   number =    {10076},
     27   series =    {LNCS},
     28   pages =     {251-270},
     29   month =     {Dec},
     30   publisher = {Springer},
     31 }
     32 @InProceedings{10.1007/3-540-48910-X_16,
     33 author="Paillier, Pascal",
     34 editor="Stern, Jacques",
     35 title="Public-Key Cryptosystems Based on Composite Degree Residuosity Classes",
     36 booktitle="Advances in Cryptology --- EUROCRYPT '99",
     37 year="1999",
     38 publisher="Springer Berlin Heidelberg",
     39 address="Berlin, Heidelberg",
     40 pages="223--238",
     41 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.",
     42 isbn="978-3-540-48910-8"
     43 }
     44 
     45 @TechReport{smcgeo,
     46   author =       {Mikhail J. Atallah and Wenliang Du},
     47   title =        {Secure Multi-Party Computational Geometry},
     48   institution =  {Purdue University},
     49   year =         {2001},
     50   number =    {2001-48},
     51   address =   {West Lafayette, IN 47907},
     52 }
     53 
     54 @inproceedings{IoannidisGA02,
     55   author    = {Ioannis Ioannidis and
     56                Ananth Grama and
     57                Mikhail J. Atallah},
     58   title     = {A Secure Protocol for Computing Dot-Products in Clustered and Distributed
     59                Environments},
     60   booktitle = {31st International Conference on Parallel Processing {(ICPP} 2002),
     61                20-23 August 2002, Vancouver, BC, Canada},
     62   pages     = {379--384},
     63   publisher = {{IEEE} Computer Society},
     64   year      = {2002},
     65   url       = {https://doi.org/10.1109/ICPP.2002.1040894},
     66   doi       = {10.1109/ICPP.2002.1040894},
     67   timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
     68   biburl    = {https://dblp.org/rec/conf/icpp/IoannidisGA02.bib},
     69   bibsource = {dblp computer science bibliography, https://dblp.org}
     70 }
     71 
     72 @INPROCEEDINGS{Amirbekyan_anew,
     73     author = {Artak Amirbekyan and Vladimir Estivill-castro},
     74     title = {A new efficient privacypreserving scalar product protocol},
     75     booktitle = {in Proc. of AusDM ’07},
     76     year = {},
     77     pages = {209--214}
     78 }
     79 
     80 @Inbook{Chaum1984,
     81 author="Chaum, David",
     82 title="Blind Signature System",
     83 bookTitle="Advances in Cryptology: Proceedings of Crypto 83",
     84 year="1984",
     85 publisher="Springer US",
     86 address="Boston, MA",
     87 pages="153--153",
     88 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.",
     89 isbn="978-1-4684-4730-9",
     90 doi="10.1007/978-1-4684-4730-9_14",
     91 url="https://doi.org/10.1007/978-1-4684-4730-9_14"
     92 }