Sciweavers

239 search results - page 24 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
EUROCRYPT
2008
Springer
13 years 10 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
HPDC
2008
IEEE
14 years 3 months ago
StoreGPU: exploiting graphics processing units to accelerate distributed storage systems
Today Graphics Processing Units (GPUs) are a largely underexploited resource on existing desktops and a possible costeffective enhancement to high-performance systems. To date, mo...
Samer Al-Kiswany, Abdullah Gharaibeh, Elizeu Santo...
IUI
2010
ACM
14 years 5 months ago
Mobia Modeler: easing the creation process of mobile applications for non-technical users
The development of mobile applications has now extended from mobile network providers into the hands of ordinary people as organizations and companies encourage people to come up ...
Florence T. Balagtas-Fernandez, Max Tafelmayer, He...
DC
2008
13 years 8 months ago
Solo-valency and the cost of coordination
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...
Danny Hendler, Nir Shavit