66 search results - page 8 / 14 » crypto 2009 |
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...