Sciweavers

252 search results - page 42 / 51
» How Secure is Deterministic Encryption
Sort
View
ACISP
2008
Springer
14 years 2 months ago
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphe...
Debra L. Cook, Moti Yung, Angelos D. Keromytis
ISCC
2005
IEEE
132views Communications» more  ISCC 2005»
14 years 1 months ago
A Reputation-Based Trust Mechanism for Ad Hoc Networks
— The main characterisrics of ad hoc networks are the lack of predefined infrastructure and the dynamic topology. These characteristics present some new security vulnerabilities...
Yacine Rebahi, Vicente E. Mujica V, Dorgham Sisale...
NSPW
2003
ACM
14 years 26 days ago
Public key distribution through "cryptoIDs"
In this paper, we argue that person-to-person key distribution is best accomplished with a key-centric approach, instead of PKI: users should distribute public key fingerprints in...
Trevor Perrin
ICEB
2004
175views Business» more  ICEB 2004»
13 years 9 months ago
Privacy-Preserving Collaborative Association Rule Mining
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among parties i...
Justin Z. Zhan, Stan Matwin, Nathalie Japkowicz, L...
IJACT
2008
158views more  IJACT 2008»
13 years 7 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...