Sciweavers

51 search results - page 7 / 11
» Efficient Public Key Encryption Based on Ideal Lattices
Sort
View
DCC
2005
IEEE
15 years 9 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
ICC
2007
IEEE
136views Communications» more  ICC 2007»
15 years 1 months ago
SAMcast - A Scalable, Secure and Authenticated Multicast Protocol for Large Scale P2P Networks
Overlay networks have shown tremendous potential in solving large scale data dissemination problem by employing peer-to-peer communication protocols. These networks, however, have ...
Waseem Ahmad, Ashfaq A. Khokhar
JCP
2006
120views more  JCP 2006»
14 years 9 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 4 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
SCN
2010
Springer
232views Communications» more  SCN 2010»
14 years 7 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena