Sciweavers

567 search results - page 95 / 114
» Decomposing replicable functions
Sort
View
CCS
2008
ACM
13 years 10 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
EWSA
2005
Springer
14 years 2 months ago
Architecture Description for Mobile Distributed Systems
Abstract. In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on the π-calculus. Different from other approaches, the non-fu...
Volker Gruhn, Clemens Schäfer
APLAS
2010
ACM
13 years 8 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
SIGCOMM
2010
ACM
13 years 8 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
CVPR
2009
IEEE
2115views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Real-Time O(1) Bilateral Filtering
We propose a new bilateral filtering algorithm with computational complexity invariant to filter kernel size, socalled O(1) or constant time in the literature. By showing that a...
Kar-Han Tan, Narendra Ahuja, Qingxiong Yang