Sciweavers

598 search results - page 10 / 120
» On the Security of ElGamal Based Encryption
Sort
View
ACNS
2003
Springer
131views Cryptology» more  ACNS 2003»
14 years 26 days ago
On the Security of Two Threshold Signature Schemes with Traceable Signers
A (t, n) threshold signature scheme allows t or more group members to generate signatures on behalf of a group with n members, while any t−1 or less members cannot do the same th...
Guilin Wang, Xiaoxi Han, Bo Zhu
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
IJISEC
2007
87views more  IJISEC 2007»
13 years 7 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
On the Secrecy Capacity of Fading Channels
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of...
Praveen Kumar Gopala, Lifeng Lai, Hesham El Gamal