Sciweavers

1173 search results - page 189 / 235
» On the Compositionality of Round Abstraction
Sort
View
PERCOM
2009
ACM
14 years 10 months ago
Programmable Presence Virtualization for Next-Generation Context-Based Applications
Abstract--Presence, broadly defined as an event publishnotification infrastructure for converged applications, has emerged as a key mechanism for collecting and disseminating conte...
Arup Acharya, Nilanjan Banerjee, Dipanjan Chakrabo...
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 10 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
ESORICS
2002
Springer
14 years 9 months ago
Computational Probabilistic Non-interference
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
Michael Backes, Birgit Pfitzmann
EWSN
2008
Springer
14 years 9 months ago
A Component Framework for Content-Based Publish/Subscribe in Sensor Networks
Component-based architectures are the traditional approach cile application specific optimization with reusable abstractions in sensor networks. However, they frequently overwhelm ...
Adam Wolisz, Andreas Köpke, Andreas Willig, J...
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
14 years 6 months ago
Verification of arithmetic datapaths using polynomial function models and congruence solving
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Neal Tew, Priyank Kalla, Namrata Shekhar, Sivaram ...