Sciweavers

IJNSEC
2010
128views more  IJNSEC 2010»
13 years 7 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
IEEEARES
2009
IEEE
13 years 10 months ago
Reducing the Cost of Session Key Establishment
Scenarios such as online banking, mobile payment systems, stock trading, selling merchandise, and a host of other applications that need a high level of security have moved from th...
Bezawada Bruhadeshwar, Kishore Kothapalli, Maddi S...
CCS
2010
ACM
14 years 20 days ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
FM
2006
Springer
153views Formal Methods» more  FM 2006»
14 years 4 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
CISC
2007
Springer
129views Cryptology» more  CISC 2007»
14 years 4 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