Sciweavers

4111 search results - page 368 / 823
» Security, Protocols, and Trust
Sort
View
FCS
2006
15 years 9 months ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu
VTC
2010
IEEE
167views Communications» more  VTC 2010»
15 years 6 months ago
An Efficient Authentication Scheme for Security and Privacy Preservation in V2I Communications
—In this paper, we propose a mutual authentication and key agreement scheme for V2I communications. Our scheme improves security and privacy protection compared with the existing...
Jung-Yoon Kim, Hyoung-Kee Choi, John A. Copeland
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 11 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
SCN
2008
Springer
15 years 7 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
IEEEIAS
2009
IEEE
15 years 5 months ago
An Improved Scheme of Single Sign-on Protocol
In order to avoid security threats caused by password attack and replay attack in single sign-on protocal, the most methods on sovling these issues are making use of complicated te...
Yang Jian