Sciweavers

2575 search results - page 30 / 515
» Providing security with insecure systems
Sort
View
NGC
2000
Springer
15 years 3 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
IACR
2011
133views more  IACR 2011»
13 years 11 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
16 years 5 days ago
A new scheme on privacy-preserving data classification
We address privacy-preserving classification problem in a distributed system. Randomization has been the approach proposed to preserve privacy in such scenario. However, this appr...
Nan Zhang 0004, Shengquan Wang, Wei Zhao
AFRICACRYPT
2008
Springer
15 years 1 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
ASIACRYPT
2004
Springer
15 years 5 months ago
New Approaches to Password Authenticated Key Exchange Based on RSA
We investigate efficient protocols for password-authenticated key exchange based on the RSA public-key cryptosystem. To date, most of the published protocols for password-authentic...
Muxiang Zhang