Sciweavers

36 search results - page 6 / 8
» Robust Secret Sharing Schemes Against Local Adversaries
Sort
View
ASIACRYPT
1999
Springer
14 years 3 months ago
Periodical Multi-secret Threshold Cryptosystems
A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. ...
Masayuki Numao
ASIACRYPT
2009
Springer
14 years 5 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
GLOBECOM
2007
IEEE
14 years 5 months ago
Developing a Group-based Security Scheme for Wireless Sensor Networks
—This paper presents a group-based security scheme for distributed wireless sensor networks. The scheme is proposed with 3-types of entities: one or more base stations, Y number ...
Md. Abdul Hamid, Md. Mustafizur Rahman, Young Yig ...
CARDIS
2006
Springer
159views Hardware» more  CARDIS 2006»
14 years 2 months ago
Noisy Tags: A Pretty Good Key Exchange Protocol for RFID Tags
We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag sugge...
Claude Castelluccia, Gildas Avoine
JOC
2007
133views more  JOC 2007»
13 years 10 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin