Sciweavers

783 search results - page 65 / 157
» On security proof of McCullagh
Sort
View
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
14 years 2 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
ASIACRYPT
2000
Springer
14 years 1 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
INFORMATICALT
2006
105views more  INFORMATICALT 2006»
13 years 10 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
ENTCS
2007
94views more  ENTCS 2007»
13 years 10 months ago
On the Security of Tag-KEM for Signcryption
Signcryption tag-KEM (Key Encapsulation Mechanism with a tag) is an authenticated tag-KEM for generic construction of hybrid signcryption. Signcryption tagKEM allows the sender to...
Maki Yoshida, Toru Fujiwara
IEEEARES
2008
IEEE
14 years 4 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma