4340 search results - page 6 / 868 » Formal Methods and Cryptography |
143
Voted
AMAST
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. We summarize the results of several experiments in applying a metamethod for formal method integration [18, 19]. We provide a small example of using an instance of integr...
FC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
CSFW
2010
IEEE
15 years 3 months ago
2010
IEEE
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
116
Voted
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...
103
click to vote
EUROCRYPT
2009
Springer
16 years 6 days ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...