Sciweavers

145 search results - page 13 / 29
» Secure Two-Party Computation with Low Communication
Sort
View
DEXAW
2005
IEEE
127views Database» more  DEXAW 2005»
14 years 2 months ago
A Key Establishment IP-Core for Ubiquitous Computing
A most critical and complex issue with regard to constrained devices in the ubiquitous and pervasive computing setting is secure key exchange. The restrictions motivate the invest...
Markus Volkmer, Sebastian Wallner
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
13 years 9 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro
ANCS
2009
ACM
13 years 6 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
NOSSDAV
2009
Springer
14 years 3 months ago
End-to-end secure delivery of scalable video streams
We investigate the problem of securing the delivery of scalable video streams so that receivers can ensure the authenticity (originality and integrity) of the video. Our focus is ...
Kianoosh Mokhtarian, Mohamed Hefeeda
SAC
2006
ACM
14 years 2 months ago
Bootstrapping multi-party ad-hoc security
Increasingly pervasive computing throws up scenarios where users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where...
Sadie Creese, Michael Goldsmith, Bill Roscoe, Ming...