diff options
author | Jeff Burdges <burdges@gnunet.org> | 2016-03-25 14:01:27 +0100 |
---|---|---|
committer | Jeff Burdges <burdges@gnunet.org> | 2016-03-25 14:01:27 +0100 |
commit | 3d04687b6f55faa7923a75ca12ad7fab01927f38 (patch) | |
tree | c490041b3689862d85b559bbaa1afea3b73c890e | |
parent | 73a05107052ce4aa3c417dd16179c8a022b38575 (diff) |
References for FDH, one-more-inversion, RSA-KTI vs RSA-CTI, etc.
-rw-r--r-- | doc/paper/taler.bib | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/doc/paper/taler.bib b/doc/paper/taler.bib index b5bd5938d..10f4ef439 100644 --- a/doc/paper/taler.bib +++ b/doc/paper/taler.bib @@ -173,3 +173,63 @@ www_pdf_url = {https://www.torproject.org/svn/trunk/doc/design-paper/tor-design.pdf}, www_section = {Anonymous communication}, } + + +@inbook{BellareRogaway1996, + author="Bellare, Mihir and Rogaway, Phillip", + editor="Maurer, Ueli", + chapter="The Exact Security of Digital Signatures-How to Sign with RSA and Rabin", + title="Advances in Cryptology --- EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques Saragossa, Spain, May 12--16, 1996 Proceedings", + year="1996", + publisher="Springer Berlin Heidelberg", + address="Berlin, Heidelberg", + pages="399--416", + isbn="978-3-540-68339-1", + doi="10.1007/3-540-68339-9_34", + url_doi="http://dx.doi.org/10.1007/3-540-68339-9_34", + url="http://web.cs.ucdavis.edu/~rogaway/papers/exact.pdf" +} + + + +@article{OneMoreInversion, + author="Bellare and Namprempre and Pointcheval and Semanko", + title="The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme ", + journal="Journal of Cryptology", + volume="16", + number="3", + pages="185--215", + abstract="We introduce a new class of computational problems which we call the ``one-more-RSA-inversion'' problems. Our main result is that two problems in this class, which we call the chosen-target and known-target inversion problems, respectively, have polynomially equivalent computational complexity. We show how this leads to a proof of security for Chaum's RSA-based blind signature scheme in the random oracle model based on the assumed hardness of either of these problems. We define and prove analogous results for ``one-more-discrete-logarithm'' problems. Since the appearence of the preliminary version of this paper, the new problems we have introduced have found other uses as well.", + issn="1432-1378", + doi="10.1007/s00145-002-0120-1", + url_doi="http://dx.doi.org/10.1007/s00145-002-0120-1" + url="https://eprint.iacr.org/2001/002" +} + +@misc{cryptoeprint:2001:002, + author = {M. Bellare and C. Namprempre and D. Pointcheval and M. Semanko}, + title = {The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme}, + howpublished = {Cryptology ePrint Archive, Report 2001/002}, + year = {2001}, + note = {\url{http://eprint.iacr.org/}}, +} + + +@inbook{RSA-KTIvCTI, + author="Bellare, Mihir and Namprempre, Chanathip and Pointcheval, David and Semanko, Michael", + editor="Syverson, Paul", + chapter="The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme", + title="Financial Cryptography: 5th International Conference, FC 2001 Grand Cayman, British West Indies, February 19--22, 2001 Proceedings", + year="2002", + publisher="Springer Berlin Heidelberg", + address="Berlin, Heidelberg", + pages="319--338", + isbn="978-3-540-46088-6", + doi="10.1007/3-540-46088-8_25", + url_doi="https://www.di.ens.fr/~pointche/Documents/Papers/2001_fcA.pdf" +} + + + + + |