Sciweavers

211 search results - page 3 / 43
» A Message Recognition Protocol Based on Standard Assumptions
Sort
View
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 5 days ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...
CCS
2008
ACM
13 years 8 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ICALP
2005
Springer
13 years 11 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
ACNS
2009
Springer
143views Cryptology» more  ACNS 2009»
14 years 20 days ago
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks
Abstract. We examine the problem of message recognition by reviewing the definitions and the security model in the literature. In particular, we examine the Jane Doe protocol, whi...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
ASIACRYPT
2006
Springer
13 years 9 months ago
A Scalable Password-Based Group Key Exchange Protocol in the Standard Model
This paper presents a secure constant-round password-based group key exchange protocol in the common reference string model. Our protocol is based on the group key exchange protoco...
Michel Abdalla, David Pointcheval