Sciweavers

48 search results - page 2 / 10
» Computing Inverses over a Shared Secret Modulus
Sort
View
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
13 years 7 months ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
CSR
2008
Springer
13 years 7 months ago
Cryptanalysis of Stickel's Key Exchange Scheme
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...
Vladimir Shpilrain
EUROCRYPT
2009
Springer
14 years 5 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
ESAS
2007
Springer
13 years 9 months ago
The Candidate Key Protocol for Generating Secret Shared Keys from Similar Sensor Data Streams
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independ...
Rene Mayrhofer
IPPS
2005
IEEE
13 years 11 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...