Sciweavers

570 search results - page 91 / 114
» Black-box constructions for secure computation
Sort
View
IJACT
2008
136views more  IJACT 2008»
13 years 8 months ago
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries
: In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation betw...
Mike Burmester, Breno de Medeiros, Rossana Motta
ASIACRYPT
2004
Springer
14 years 1 months ago
Secret Handshakes from CA-Oblivious Encryption
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
Claude Castelluccia, Stanislaw Jarecki, Gene Tsudi...
GRID
2004
Springer
14 years 1 months ago
Distributed Ant: A System to Support Application Deployment in the Grid
e-Science has much to benefit from the emerging field of grid computing. However, construction of e-Science grids is a complex and inefficient undertaking. In particular, deployme...
Wojtek Goscinski, David Abramson
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 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
ICS
2010
Tsinghua U.
14 years 5 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...