20 search results - page 1 / 4 » Construction of Dynamic Threshold Decryption Scheme from Pai... |
IJNSEC
2006
13 years 4 months ago
2006
The first dynamic threshold decryption scheme from pairing is presented. It is secure in groups equipped with a bilinear map, and caters to some important requirements in real app...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...
CTRSA
2005
Springer
13 years 10 months ago
2005
Springer
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...
CISC
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...