4340 search results - page 94 / 868 » Formal Methods and Cryptography |
141
Voted
GMP
2003
IEEE
15 years 9 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
139
Voted
AI
2008
Springer
15 years 10 months ago
2008
Springer
In this paper, we present a method to identify topics in email messages. The formal concept analysis is adopted as a semantic analysis method to group emails containing the same ke...
133
click to vote
ISOLA
2007
Springer
15 years 10 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
158
Voted
TCC
2005
Springer
15 years 9 months ago
2005
Springer
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
140
click to vote
ASIACRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...