Sciweavers

621 search results - page 117 / 125
» Efficient Secure Multi-party Computation
Sort
View
ICS
2010
Tsinghua U.
14 years 7 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
HPDC
2010
IEEE
13 years 10 months ago
A GPU accelerated storage system
Massively multicore processors, like, for example, Graphics Processing Units (GPUs), provide, at a comparable price, a one order of magnitude higher peak performance than traditio...
Abdullah Gharaibeh, Samer Al-Kiswany, Sathish Gopa...
EUROCRYPT
1995
Springer
14 years 1 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
SAC
2003
ACM
14 years 3 months ago
Systems Architecture for Pervasive Retail
Recent developments in mobile technologies and associated economies of scale via mature manufacturing processes have made possible the construction of pervasive systems in specifi...
George Roussos, Panos Kourouthanasis, Eugene A. Gr...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 10 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs