Sciweavers

6907 search results - page 778 / 1382
» Securing distributed adaptation
Sort
View
TYPES
2004
Springer
16 years 15 days ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
INDOCRYPT
2003
Springer
16 years 11 days ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
AH
2000
Springer
15 years 11 months ago
Case-Based User Profiling for Content Personalisation
As it stands the Internet’s “one size fits all” approach to information retrieval presents the average user with a serious information overload problem. Adaptive hypermedia s...
Keith Bradley, Rachael Rafter, Barry Smyth
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
15 years 11 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 10 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
John Kelsey, Stefan Lucks