Sciweavers

1562 search results - page 201 / 313
» Mathematics, Cryptology, Security
Sort
View
EUROCRYPT
2005
Springer
14 years 1 months ago
3-Move Undeniable Signature Scheme
In undeniable signature schemes, zero-knowledgeness and non-transferability have been identified so far. In this paper, by separating these two notions, we show the first 3-move ...
Kaoru Kurosawa, Swee-Huay Heng
HIP
2005
Springer
174views Cryptology» more  HIP 2005»
14 years 1 months ago
Collaborative Filtering CAPTCHAs
Abstract. Current CAPTCHAs require users to solve objective questions such as text recognition or image recognition. We propose a class of CAPTCHAs based on collaborative filterin...
Monica Chew, J. D. Tygar
WCC
2005
Springer
117views Cryptology» more  WCC 2005»
14 years 1 months ago
Interpolation of Functions Related to the Integer Factoring Problem
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
Clemens Adelmann, Arne Winterhof
ACNS
2004
Springer
104views Cryptology» more  ACNS 2004»
14 years 1 months ago
Key Agreement Using Statically Keyed Authenticators
A family of authenticators based on static shared keys is identified and proven secure. The authenticators can be used in a variety of settings, including identity-based ones. App...
Colin Boyd, Wenbo Mao, Kenneth G. Paterson
CRYPTO
2004
Springer
139views Cryptology» more  CRYPTO 2004»
14 years 1 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