Sciweavers

1769 search results - page 345 / 354
» Cryptography
Sort
View
EUROCRYPT
2008
Springer
13 years 11 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
WORM
2003
13 years 11 months ago
Access for sale: a new class of worm
The damage inflicted by viruses and worms has been limited because the payloads that are most lucrative to malware authors have also posed the greatest risks to them. The problem...
Stuart E. Schechter, Michael D. Smith
ECIS
2000
13 years 11 months ago
Retailing Digital Products
Current research activities in the area of trading digital products usually focus on specific legal or technical problems, neglecting the underlying business models and their impl...
Redmer Luxem, Lars H. Ehlers
ICISC
1998
110views Cryptology» more  ICISC 1998»
13 years 11 months ago
The nonhomomorphicity of S-boxes
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
Yuliang Zheng, Xian-Mo Zhang
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...