Sciweavers

5484 search results - page 166 / 1097
» Almost-Everywhere Secure Computation
Sort
View
CSFW
2012
IEEE
13 years 6 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
APNOMS
2006
Springer
15 years 8 months ago
A Resource-Optimal Key Pre-distribution Scheme with Enhanced Security for Wireless Sensor Networks
Abstract. This paper proposes an efficient resource-optimal key predistribution scheme for providing improved security in wireless sensor networks. We exploit the advantages of two...
Tran Thanh Dai, Al-Sakib Khan Pathan, Choong Seon ...
FOSAD
2000
Springer
15 years 8 months ago
Notes on Nominal Calculi for Security and Mobility
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
Andrew D. Gordon
DMIN
2006
123views Data Mining» more  DMIN 2006»
15 years 5 months ago
Novel Evaluation Framework of Intrusion Detection Systems with Respect to Security Policies
Intrusion Detection System is an integral component of the computer security infrastructure. It is usually put in place to detect computer security policy violations. While its ro...
Negmat Mullodzhanov
IACR
2011
212views more  IACR 2011»
14 years 4 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...