Sciweavers

51692 search results - page 10192 / 10339
» is 2008
Sort
View
215
Voted
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 8 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
175
Voted
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 8 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...
175
Voted
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
15 years 8 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
206
Voted
CSCLP
2008
Springer
15 years 8 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
190
Voted
CSCW
2008
ACM
15 years 8 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 »