Sciweavers

138 search results - page 4 / 28
» A Proposal of Short Proxy Signature using Pairing
Sort
View
ACMSE
2009
ACM
13 years 4 months ago
A secure unidirectional proxy re-encryption using identity and secret key exchange
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
Edna Milgo
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 3 days ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 6 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
CANS
2008
Springer
86views Cryptology» more  CANS 2008»
13 years 8 months ago
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the sa...
Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen
CSJM
2006
77views more  CSJM 2006»
13 years 6 months ago
An Approach to Shorten Digital Signature Length
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
Nikolay A. Moldovyan