10 search results - page 1 / 2 » A Flaw in the Use of Minimal Defining Sets for Secret Sharin... |
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
UCS
2007
Springer
13 years 10 months ago
2007
Springer
Many of today’s proposed RFID privacy schemes rely on the encryption of tag IDs with user-chosen keys. However, password management quickly becomes a bottleneck in such proposals...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
MOBISYS
2005
ACM
14 years 4 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
CSREASAM
2007
13 years 6 months ago
2007
In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11...