Sciweavers

261 search results - page 35 / 53
» On the Security of Some Password-Based Key Agreement Schemes
Sort
View
EUROCRYPT
2008
Springer
14 years 20 days ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
IJACT
2008
158views more  IJACT 2008»
13 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...
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
14 years 2 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
MOBISYS
2006
ACM
14 years 10 months ago
LIGER: implementing efficient hybrid security mechanisms for heterogeneous sensor networks
The majority of security schemes available for sensor networks assume deployment in areas without access to a wired infrastructure. More specifically, nodes in these networks are ...
Patrick Traynor, Raju Kumar, Hussain Bin Saad, Guo...