Sciweavers

1825 search results - page 277 / 365
» Cryptographic Securities Exchanges
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
14 years 12 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
JOC
1998
135views more  JOC 1998»
14 years 11 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
JOC
2010
106views more  JOC 2010»
14 years 10 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
JCS
2011
72views more  JCS 2011»
14 years 6 months ago
Automatically deriving information-theoretic bounds for adaptive side-channel attacks
We present a model of adaptive attacks which we combine with information-theoretic metrics to quantify the information revealed to an adaptive adversary. This enables us to expres...
Boris Köpf, David A. Basin
EEE
2005
IEEE
15 years 5 months ago
Towards Access Control for Visual Web Model Management
With the advance of E-Commerce over Web-based information, the interoperability of isolated XML repositories and databases over the Internet has drawn an increasing interest recen...
Guang-Lei Song, Kang Zhang, Bhavani M. Thuraisingh...