Sciweavers

503 search results - page 23 / 101
» An Independence Relation for Sets of Secrets
Sort
View
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
13 years 6 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
TCC
2007
Springer
114views Cryptology» more  TCC 2007»
14 years 2 months ago
Multi-authority Attribute Based Encryption
Abstract. In an identity based encryption scheme, each user is identified by a unique identity string. An attribute based encryption scheme (ABE), in contrast, is a scheme in whic...
Melissa Chase
ICISC
2008
89views Cryptology» more  ICISC 2008»
13 years 10 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik
ICICS
2005
Springer
14 years 2 months ago
Asymmetric Concurrent Signatures
The concept of concurrent signatures allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from a third party’s point of vie...
Khanh Nguyen
CCS
2006
ACM
14 years 7 days ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven