Sciweavers

490 search results - page 51 / 98
» A New Public-Key Cryptosystem
Sort
View
CHINAF
2008
69views more  CHINAF 2008»
15 years 4 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
NSDI
2007
15 years 6 months ago
Information Slicing: Anonymity Using Unreliable Overlays
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
Sachin Katti, Jeff Cohen, Dina Katabi
IJNSEC
2008
154views more  IJNSEC 2008»
15 years 4 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
130
Voted
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
15 years 8 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
ICCSA
2007
Springer
15 years 7 months ago
Estimation of TTP Features in Non-repudiation Service
In order to achieve a high performance in a real implementation of the non-repudiation service it is necessary to estimate timeouts, TTP features, publication key time, number of o...
Mildrey Carbonell, José María Sierra...