Sciweavers

39 search results - page 2 / 8
» Improved Non-committing Encryption with Applications to Adap...
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 7 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
WWIC
2004
Springer
139views Communications» more  WWIC 2004»
14 years 10 days ago
A Scalable and Adaptive Key Management Protocol for Group Communication
Abstract. Multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. In order to offer secrecy for multicast applic...
Yacine Challal, Hatem Bettahar, Abdelmadjid Bouabd...
CCS
2010
ACM
13 years 7 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
FSE
2009
Springer
159views Cryptology» more  FSE 2009»
14 years 1 months ago
Intel's New AES Instructions for Enhanced Performance and Security
The Advanced Encryption Standard (AES) is the Federal Information Processing Standard for symmetric encryption. It is widely believed to be secure and efficient, and is therefore b...
Shay Gueron
IWCMC
2006
ACM
14 years 29 days ago
TARP: trust-aware routing protocol
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....