204 search results - page 28 / 41 » On Provably Secure Time-Stamping Schemes |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
CHES
2011
Springer
12 years 7 months ago
2011
Springer
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
ADHOCNOW
2010
Springer
13 years 9 months ago
2010
Springer
Designing message integrity schemes for data aggregation is an imperative problem for securing wireless sensor networks. In this paper, we propose three secure aggregation schemes ...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cas...