Sciweavers

94 search results - page 4 / 19
» Proxy Re-signature Schemes Without Random Oracles
Sort
View
TIT
2011
125views more  TIT 2011»
13 years 2 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud
AFRICACRYPT
2010
Springer
14 years 2 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 1 months 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...
PKC
2007
Springer
189views Cryptology» more  PKC 2007»
14 years 1 months ago
Parallel Key-Insulated Public Key Encryption Without Random Oracles
Abstract. Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently i...
Benoît Libert, Jean-Jacques Quisquater, Moti...
DCC
2008
IEEE
14 years 7 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...