Sciweavers

1082 search results - page 127 / 217
» interactions 2000
Sort
View
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen
MM
1999
ACM
108views Multimedia» more  MM 1999»
14 years 1 months ago
Visual digests for news video libraries
The Informedia Digital Video Library contains over 2000 hours of video, growing at a rate of 15 hours per week. A good query engine is not sufficient for information retrieval bec...
Michael G. Christel
ASIACRYPT
2000
Springer
14 years 25 days ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
CP
2000
Springer
14 years 24 days ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
Luís Baptista, João P. Marques Silva
DEXAW
2000
IEEE
149views Database» more  DEXAW 2000»
14 years 24 days ago
A Flexible Mobile-Agent Framework for Accessing Information Systems in Disconnected Computing Environments
Over the last few years, the importance of mobile computing as been steadily increasing. While it is important to provide support for accessing databases in disconnected computing...
Paulo Marques, Luís Moura Silva, Joã...