Sciweavers

121 search results - page 10 / 25
» An Efficient and Secure Cryptosystem for Encrypting Long Mes...
Sort
View
IJACT
2008
158views more  IJACT 2008»
14 years 11 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
SCN
2008
Springer
14 years 11 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
IEICET
2006
108views more  IEICET 2006»
14 years 11 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
ISCC
2008
IEEE
143views Communications» more  ISCC 2008»
15 years 6 months ago
SSMS - A secure SMS messaging protocol for the m-payment systems
The GSM network with the greatest worldwide number of users, succumbs to several security vulnerabilities. The Short Message Service (SMS) is one of its superior and well-tried se...
Mohsen Toorani, Ali Asghar Beheshti Shirazi
IJNSEC
2010
128views more  IJNSEC 2010»
14 years 6 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