Sciweavers

120 search results - page 8 / 24
» A Practical and Secure Communication Protocol in the Bounded...
Sort
View
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 4 days ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
ICICS
2007
Springer
13 years 11 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
INFOCOM
2011
IEEE
12 years 11 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
CRYPTO
2005
Springer
149views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Authenticating Pervasive Devices with Human Protocols
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
Ari Juels, Stephen A. Weis
SCN
2010
Springer
122views Communications» more  SCN 2010»
13 years 6 months ago
A New Security Model for Authenticated Key Agreement
The Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for key agreement protocols. We discuss security s...
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Cla...