TY  - INPR
A1  - Fischlin, Marc
A2  - Naccache, David
T1  - A cost-effective pay-per-multiplication comparison method for millionaires
N2  - Based on the quadratic residuosity assumption we present a non-interactive crypto-computing protocol for the greater-than function, i.e., a non-interactive procedure between two parties such that only the relation of the parties' inputs is revealed. In comparison to previous solutions our protocol reduces the number of modular multiplications significantly. We also discuss applications to conditional oblivious transfer, private bidding and the millionaires' problem.
KW  - Kryptologie
KW  - Kongress
KW  - San Francisco
KW  - Online-Publikation
KW  - Security Parameter
KW  - Modular Multiplication
KW  - Random String
KW  - Quadratic Residue
KW  - Oblivious Transfer
Y1  - 2001
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4227
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12611
SN  - 978-3-540-41898-6
SN  - 3-540-41898-9
SN  - 978-3-540-45353-6
N1  - Erschienen in: David Naccache (Hrsg.): Topics in cryptology : the Cryptographers' Track at the RSA Conference 2001 ; proceedings, Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer, 2001, Lecture notes in computer science ; Vol. 2020, S. 457-471, ISBN: 978-3-540-41898-6, ISBN: 3-540-41898-9, ISBN: 978-3-540-45353-6, doi:10.1007/3-540-45353-9_33
ER  -