Sciweavers

773 search results - page 50 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
16 years 1 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
FSTTCS
2009
Springer
16 years 22 days ago
Functionally Private Approximations of Negligibly-Biased Estimators
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
André Madeira, S. Muthukrishnan
EUROCRYPT
2004
Springer
15 years 10 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
CSFW
2012
IEEE
13 years 8 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
CCS
2009
ACM
16 years 6 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria