Sciweavers

324 search results - page 14 / 65
» A new signature scheme without random oracles
Sort
View
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
13 years 8 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot
CTRSA
2007
Springer
98views Cryptology» more  CTRSA 2007»
13 years 9 months ago
Identity-Based Multi-signatures from RSA
Abstract. Multi-signatures allow multiple signers to jointly authenticate a message using a single compact signature. Many applications however require the public keys of the signe...
Mihir Bellare, Gregory Neven
ISW
2007
Springer
14 years 1 months ago
Identity-Based Proxy Re-encryption Without Random Oracles
A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert ...
Cheng-Kang Chu, Wen-Guey Tzeng
ASIACRYPT
2009
Springer
14 years 2 months ago
Simple Adaptive Oblivious Transfer without Random Oracle
Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol whic...
Kaoru Kurosawa, Ryo Nojima
ASIACRYPT
2000
Springer
13 years 11 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson