Article
Licensed
Unlicensed
Requires Authentication
Provable security of digital signatures in the tamper-proof device model
-
N. P. Varnovskii
Published/Copyright:
September 30, 2008
Abstract
Proofs of security for practical signature schemes are known in idealised models only. In the present paper, we consider the tamper-proof device model that does not use ideal primitives. Instead of access to a random oracle each participant is provided with tamper-proof device implementing a private-key cryptosystem. The hash-value of a message to be signed is submitted to the tamper-proof device for encryption and this encrypted value is used in the signature generation algorithm. In this model, we prove, modulo a physical assumption, a necessary and sufficient condition for security of the GOST signature scheme.
Received: 2008-08-25
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
