Sciweavers

118 search results - page 12 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
TCC
2007
Springer
145views Cryptology» more  TCC 2007»
16 years 5 days ago
(Password) Authenticated Key Establishment: From 2-Party to Group
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
Michel Abdalla, Jens-Matthias Bohli, Maria Isabel ...
CCS
2004
ACM
15 years 11 months ago
Concealing complex policies with hidden credentials
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
Robert W. Bradshaw, Jason E. Holt, Kent E. Seamons
TIT
2008
187views more  TIT 2008»
15 years 5 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
EUC
2007
Springer
16 years 6 days ago
Attack-Resilient Random Key Distribution Scheme for Distributed Sensor Networks
Abstract. Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main ...
Firdous Kausar, Sajid Hussain, Tai-Hoon Kim, Ashra...
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
15 years 9 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel