Sciweavers

241 search results - page 42 / 49
» On Proactive Secret Sharing Schemes
Sort
View
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
15 years 3 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
SCN
2010
Springer
142views Communications» more  SCN 2010»
14 years 10 months ago
How to Pair with a Human
We introduce a protocol, that we call Human Key Agreement, that allows pairs of humans to establish a key in a (seemingly hopeless) case where no public-key infrastructure is avail...
Stefan Dziembowski
PERCOM
2006
ACM
15 years 11 months ago
Multi-channel Protocols for Group Key Agreement in Arbitrary Topologies
We consider group key agreement (GKA) protocols, used by a group of peers to establish a shared secret key for multicast communications. There has been much previous work to impro...
Ford-Long Wong, Frank Stajano
CCS
2007
ACM
15 years 5 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport
ACNS
2008
Springer
96views Cryptology» more  ACNS 2008»
15 years 1 months ago
Efficient Device Pairing Using "Human-Comparable" Synchronized Audiovisual Patterns
Abstract. "Pairing" is referred to as the operation of achieving authenticated key agreement between two human-operated devices over a short- or medium-range wireless com...
Ramnath Prasad, Nitesh Saxena