Sciweavers

57 search results - page 8 / 12
» On Multiplicative Linear Secret Sharing Schemes
Sort
View
CCS
2006
ACM
14 years 10 days ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
TDSC
2010
218views more  TDSC 2010»
13 years 7 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
ICISC
2004
147views Cryptology» more  ICISC 2004»
13 years 10 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
MOBISYS
2011
ACM
12 years 11 months ago
ProxiMate: proximity-based secure pairing using ambient wireless signals
Forming secure associations between wireless devices that do not share a prior trust relationship is an important problem. This paper presents ProxiMate, a system that allows wire...
Suhas Mathur, Robert C. Miller, Alexander Varshavs...
SCN
2008
Springer
13 years 8 months ago
Linear Bandwidth Naccache-Stern Encryption
Abstract. The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying publ...
Benoît Chevallier-Mames, David Naccache, Jac...