Sciweavers

4340 search results - page 125 / 868
» Formal Methods and Cryptography
Sort
View
121
Voted
CCS
2009
ACM
15 years 10 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
124
Voted
ICFEM
2009
Springer
15 years 10 months ago
Supporting Reuse of Event-B Developments through Generic Instantiation
It is believed that reusability in formal development should reduce the time and cost of formal modelling within a production environment. Along with the ability to reuse formal mo...
Renato Silva, Michael Butler
CHES
2005
Springer
99views Cryptology» more  CHES 2005»
15 years 9 months ago
Short Memory Scalar Multiplication on Koblitz Curves
Abstract. We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We ...
Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaum...
IMA
2003
Springer
97views Cryptology» more  IMA 2003»
15 years 9 months ago
Remote User Authentication Using Public Information
A method for remote user authentication is proposed that requires only public information to be stored at the verifying host. Like the S/KEY scheme, the new technique uses only sym...
Chris J. Mitchell
127
Voted
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
15 years 8 months ago
The Logic of Large Enough
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
Eerke A. Boiten, Dan Grundy