Sciweavers

252 search results - page 47 / 51
» Computationally secure two-round authenticated message excha...
Sort
View
CASES
2003
ACM
15 years 2 months ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
CEC
2008
IEEE
15 years 4 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
NDSS
2007
IEEE
15 years 3 months ago
Secret Handshakes with Dynamic and Fuzzy Matching
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
Giuseppe Ateniese, Jonathan Kirsch, Marina Blanton
102
Voted
CCS
2010
ACM
14 years 9 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
FOCS
2002
IEEE
15 years 2 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer