The representation problem based on factoring

  • We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption. Protocols we discuss include identification schemes secure against parallel attacks, secure signatures, blind signatures and (non-malleable) commitments.
Author:Marc FischlinGND, Roger FischlinGND
Editor:Bart Preneel
Document Type:Preprint
Year of Completion:2002
Year of first Publication:2002
Publishing Institution:Universit├Ątsbibliothek Johann Christian Senckenberg
Release Date:2005/07/20
Tag:Blind Signature; Commitment; Factoring; Identification; Non-Malleability; Representation Problem; Signature
GND Keyword:Kryptologie; Kongress; San Jose
Page Number:19
First Page:1
Last Page:19
Erschienen in: Bart Preneel (Hrsg.): Topics in cryptology : the Cryptographers' Track at the RSA Conference 2002 ; proceedings, Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Tokyo : Springer, 2002, Lecture notes in computer science ; Vol. 2271, S. 96-113, ISBN: 978-3-540-43224-1, ISBN: 3-540-43224-8, doi:10.1007/3-540-45760-7_8
Source:RSA Security 2002 Cryptographer's Track , Lecture Notes in Computer Science, Vol.2271, pp.96-113, Springer-Verlag, 2002 , ,
Institutes:Informatik und Mathematik / Mathematik
Informatik und Mathematik / Informatik
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):License LogoDeutsches Urheberrecht