Sciweavers

324 search results - page 32 / 65
» A new signature scheme without random oracles
Sort
View
CCS
2010
ACM
13 years 8 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,...
ASIACRYPT
2000
Springer
14 years 26 days ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
IWSEC
2009
Springer
14 years 3 months ago
ID-Based Group Password-Authenticated Key Exchange
Abstract—Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this pa...
Xun Yi, Raylin Tso, Eiji Okamoto
CSB
2003
IEEE
110views Bioinformatics» more  CSB 2003»
14 years 1 months ago
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
Bailin Hao, Ji Qi
INFORMATICALT
2006
93views more  INFORMATICALT 2006»
13 years 8 months ago
Identity Based Multisignatures
Abstract. This paper presents identity based serial and parallel multisignature schemes using bilinear pairings. Our serial multisignature scheme requires a forced verification at ...
Raju Gangishetti, M. Choudary Gorantla, Manik Lal ...