Sciweavers

51692 search results - page 10192 / 10339
» it 2008
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak
CSCLP
2008
Springer
15 years 6 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CSCW
2008
ACM
15 years 6 months ago
Providing awareness in multi-synchronous collaboration without compromising privacy
When involved in collaborative tasks, users often choose to use multi-synchronous applications in order to concurrently work in isolation. Hence, privacy of their changes is maint...
Claudia-Lavinia Ignat, Stavroula Papadopoulou, G&e...
« Prev « First page 10192 / 10339 Last » Next »