Sciweavers

5484 search results - page 29 / 1097
» Almost-Everywhere Secure Computation
Sort
View
EUROCRYPT
2011
Springer
14 years 3 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
CCS
2010
ACM
15 years 13 hour ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
ICCS
2005
Springer
15 years 5 months ago
Dynamic and Fine-Grained Authentication and Authorization Architecture for Grid Computing
The Globus Toolkit makes it very easy and comfortable for grid users to develop and deploy grid service. As for the security mechanism, however, only static authentication and coar...
Hyunjoon Jung, Hyuck Han, Hyungsoo Jung, Heon Youn...
ICICS
2010
Springer
14 years 9 months ago
Efficient Authentication for Mobile and Pervasive Computing
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
Basel Alomair, Radha Poovendran
EUROCRYPT
2007
Springer
15 years 6 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...