Sciweavers

103 search results - page 16 / 21
» Asymmetric Concurrent Signatures
Sort
View
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
EUROCRYPT
2006
Springer
13 years 10 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
14 years 8 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou
ENTCS
2006
115views more  ENTCS 2006»
13 years 6 months ago
Distributed Reactive XML
XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype imp...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen,...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 6 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon