Sciweavers

10 search results - page 1 / 2
» New Efficient Searchable Encryption Schemes from Bilinear Pa...
Sort
View
IJNSEC
2010
128views more  IJNSEC 2010»
12 years 11 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
IJNSEC
2006
113views more  IJNSEC 2006»
13 years 4 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
13 years 8 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu
AAECC
2009
Springer
138views Algorithms» more  AAECC 2009»
13 years 9 months ago
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki ...
CISC
2007
Springer
129views Cryptology» more  CISC 2007»
13 years 8 months ago
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu, Heng Pan