Sciweavers

1562 search results - page 254 / 313
» Mathematics, Cryptology, Security
Sort
View
159
Voted
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 9 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
EUROCRYPT
2007
Springer
16 years 9 days ago
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
Krzysztof Pietrzak, Johan Sjödin
FC
2007
Springer
106views Cryptology» more  FC 2007»
16 years 9 days ago
Dynamic Virtual Credit Card Numbers
Theft of stored credit card information is an increasing threat to e-commerce. We propose a dynamic virtual credit card number scheme that reduces the damage caused by stolen credi...
Ian Molloy, Jiangtao Li, Ninghui Li
165
Voted
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
16 years 7 days ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
ACNS
2005
Springer
167views Cryptology» more  ACNS 2005»
15 years 11 months ago
Identity Based Encryption Without Redundancy
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval. This modification of the Boneh-Frank...
Benoît Libert, Jean-Jacques Quisquater