Sciweavers

283 search results - page 46 / 57
» Bi-Deniable Public-Key Encryption
Sort
View
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
14 years 1 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
14 years 1 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel
CISC
2008
Springer
148views Cryptology» more  CISC 2008»
13 years 11 months ago
Publicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity ...
Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu
IJNSEC
2011
167views more  IJNSEC 2011»
13 years 4 months ago
New Real Time Multicast Authentication Protocol
Multicast gives professional large-scale content distribution by providing an efficient transport mechanism for one-to-many and many-to-many communications. There is a number of s...
Riham Abdellatif, Heba Kamal Aslan, Salwa H. Elram...
IACR
2011
113views more  IACR 2011»
12 years 9 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren