Sciweavers

255 search results - page 31 / 51
» Security of Encryption Schemes in Weakened Random Oracle Mod...
Sort
View
CCS
2010
ACM
13 years 7 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
14 years 8 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
CRYPTO
2000
Springer
184views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator ca...
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene ...
IJNSEC
2008
108views more  IJNSEC 2008»
13 years 7 months ago
Multiplicative Forward-Secure Threshold Signature Scheme
The devastating consequence of secret key exposure in digital signature is that any signature can be forged and cannot be trusted. To mitigate the damage of secret key exposure, f...
Sherman S. M. Chow, H. W. Go, Lucas Chi Kwong Hui,...
INFORMATICALT
2006
105views more  INFORMATICALT 2006»
13 years 7 months ago
Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
Yu Long, Kefei Chen, Shengli Liu