TY  - INPR
A1  - Fischlin, Marc
A1  - Fischlin, Roger
A2  - Preneel, Bart
T1  - The representation problem based on factoring
N2  - 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.
KW  - Blind Signature
KW  - Commitment
KW  - Factoring
KW  - Identification
KW  - Non-Malleability
KW  - Representation Problem
KW  - Signature
KW  - Kryptologie
KW  - Kongress
KW  - San Jose
Y1  - 2002
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4229
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12586
SN  - 978-3-540-43224-1
SN  - 3-540-43224-8
N1  - 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
SP  - 1
EP  - 19
ER  -