Sciweavers

17 search results - page 2 / 4
» Small Size Hashes with Enhanced Security
Sort
View
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
The PHOTON Family of Lightweight Hash Functions
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
Jian Guo 0001, Thomas Peyrin, Axel Poschmann
ICIP
2004
IEEE
14 years 6 months ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
CRYPTO
2004
Springer
139views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
How to Compress Rabin Ciphertexts and Signatures (and More)
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
Craig Gentry
EUROCRYPT
2010
Springer
13 years 10 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
FOCS
2003
IEEE
13 years 10 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen