trust based clustering for group trust based clustering
play

Trust based Clustering for Group Trust based Clustering for Group - PowerPoint PPT Presentation

Jan 19, 2023 •251 likes •418 views

Trust based Clustering for Group Trust based Clustering for Group Trust based Clustering for Group Trust based Clustering for Group Key Management Key Management Key Management Key Management Hamida SEBA Graphs, Algorithms and Applications

  1. Trust based Clustering for Group Trust based Clustering for Group Trust based Clustering for Group Trust based Clustering for Group Key Management Key Management Key Management Key Management Hamida SEBA Graphs, Algorithms and Applications L aboratoire d' I nfoRmatique en I mage et S ystèmes d'information LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon 2/Ecole Centrale de Lyon http://liris.cnrs.fr

  2. In this talk: In this talk:  Group based applications  Security of Group communication  Group key management  Trust based clustering for group key management 2 Hamida SEBA

  3.  Process Group based applications Group based applications  Web service  Agent  End user application  Etc.  Teleconferencing  Distributed interactive simulation  Collaborative work  E-learning  Replicated databases  Etc. Hamida SEBA 3

  4. Security of Group Communication Security of Group Communication Confidentiality Authentication Prevention Integrity Non-repudiation 4 Hamida SEBA

  5. Confidentiality Confidentiality- Key Management Key Management  Solution= Encryption  Symmetric Key : shared between the sender and the receivers.  This key is called : the group key Main issue : how to compute and distribute keys? Hamida SEBA 5

  6. GROUP KEY MANAGEMENT GROUP KEY MANAGEMENT  GROUP KEY: a secret quantity known only to current group members A new group member can not read data exchanged before he joins the group  BACKWARD SECRECY  Any subset of group keys cannot be used to discover previous group An excluded member can keys not read data exchanged after he leaves the group  FORWARD SECRECY  Any subset of group keys cannot be used to discover subsequent keys  THE GROUP KEY MANAGEMENT PROTOCOL MUST UPDATE THE GROUP KEY (REKEY) Hamida SEBA 6

  7. MODELS OF GROUP KEYS (1) MODELS OF GROUP KEYS (1)  GROUP KEY DISTRIBUTION  One party generates a secret key and distributes it to others Pairwise model Hierarchical model (tree of members or third parties Group member Group member Key node No key generation Does key generation Hamida SEBA

  8. MODELS OF GROUP KEYS (2) MODELS OF GROUP KEYS (2)  GROUP KEY AGREEMENT  Secret key is derived jointly by two or more parties  Key is a function of information contributed by each member  No party can pre-determine the result Distributed Tree of keys (maintained by each member) Group member Does key generation No pre-determined structure Key node Hamida SEBA

  9. Group Key computation: an example Protocole de Perrig et al.,2000  N 1 N 2 N 3 N 4 g g clé g mod p 1  3  N N N N 1 2 3 4 k g mod p k g mod p , 2 , 4  bk N bk i b N g mod p 1 , 2 3 , 4 i N 2 N 1 N 4 N 3 bN bN 3 4 bN bN 1 M 2 2 M 1 M 4 M 3 Hamida SEBA 9

  10. MODELS OF GROUP KEYS (3) MODELS OF GROUP KEYS (3)  Hybrid Solutions  Cluster based. Key Agreement Key Distribution  How to construct/maintain clusters?  How to compute inter-cluster keys and intra-cluster keys? How about a security based clustering? Group member Does key generation Simple node Hamida SEBA

  11. Trust Trust-based Clustering based Clustering Know each other: Establish trust/distrust relations  Log and analyze interactions  Give scores Good interaction Bad interaction Application dependent Peer to peer network: Nodes: promiscuous mode Forward packet: + Black hole attack: - Recommendations, etc. Hamida SEBA 11

  12. Trust Trust-based Clustering based Clustering j  Two trust thresholds : S max and S min tv(j,i) [1, S min S max ,1] tv(i,l) tv(i,j)  i Total trust (TT) l tv(l,i) tv(i,k) ) Є Є [S max • tv( tv(i,j i,j) and tv( ) and tv(j,i j,i) max ,1] ,1] tv(k,i) k  Partiel Trust (PT) ) Є Є [S max ) Є Є [S min • tv( tv(i,j i,j) max ,1] and ,1] and tv( tv(j,i j,i) min , , S max max ] ) Є Є [S min ) Є Є [S max • tv( tv(i,j i,j) min , , S max max ] and ] and tv( tv(j,i j,i) max ,1] ,1] ) Є Є [S min • tv( tv(i,j i,j) ) and and tv( tv(j,i j,i) min , , S max max ]  Distrust (DT) ) Є Є [-1, • tv( tv(i,j i,j) ) and and tv( tv(j,i j,i) 1, S min min ] 12 Hamida SEBA

  13. Trust Trust-based Clustering based Clustering  Two trust thresholds : S max and S min j TT  Total trust (TT) DT i l ) Є Є [S max • tv( tv(i,j i,j) and tv( ) and tv(j,i j,i) max ,1] ,1] PT k  Partiel Trust (PT) ) Є Є [S max ) Є Є [S min • tv( tv(i,j i,j) max ,1] and ,1] and tv( tv(j,i j,i) min , , S max max ] ) Є Є [S min ) Є Є [S max • tv( tv(i,j i,j) min , , S max max ] and ] and tv( tv(j,i j,i) max ,1] ,1] ) Є Є [S min • tv( tv(i,j i,j) ) and and tv( tv(j,i j,i) min , , S max max ]  Distrust (DT) ) Є Є [-1, • tv( tv(i,j i,j) ) and and tv( tv(j,i j,i) 1, S min min ] 13 Hamida SEBA 13

  14. Trust-based Clustering Trust based Clustering Distrusted node Cluster periphery (key distribution zone) Cluster core (TT) (key agreement zone) Clusterheads Max number of Self-stabilizing algorithm: TT relations  Adaptive  Self-maintaining Hamida SEBA

  15. Example Example 1 1 1 1 3 3 1 1 1 1 1 3 3 3 3 2 2 1 1 2 3 3 2 2 1 2 2 1 Hamida SEBA 15 15

Recommend

Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering

Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering

Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering Clustering by Partitioning, e.g. k-Means Density Based Clustering, e.g. DBScan Grid Based Clustering Compendium slides for Guide to Intelligent

1.32k views • 82 slides
Outline Linkage-based Clustering Motivation Definitions Clustering with Semantic

Outline Linkage-based Clustering Motivation Definitions Clustering with Semantic

Outline Linkage-based Clustering Motivation Definitions Clustering with Semantic Links Applications Algorithms SimRank Yin X., Han J. and Yu P. S., 2006, LinkClus: Efficient ReCoM Clustering via Heterogeneous

221 views • 8 slides
Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is

Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is

Preview ! Introduction Lecture 10 ! Partitioning methods Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is Clustering? Examples of Clustering Applications ! Cluster: a collection of data objects !

301 views • 8 slides
CLUSTERING Based on Foundations of Statistical NLP, C. Manning & H. Sch utze, MIT

CLUSTERING Based on Foundations of Statistical NLP, C. Manning & H. Sch utze, MIT

0. CLUSTERING Based on Foundations of Statistical NLP, C. Manning & H. Sch utze, MIT Press, 2002, ch. 14 and Machine Learning, T. Mitchell, McGRAW Hill, 1997, ch. 6.12 1. Plan 1. Introduction to clustering Clustering

814 views • 36 slides
Machine Learning 2 DS 4420 - Spring 2018 From clustering to EM Byron C. Wallace Clustering

Machine Learning 2 DS 4420 - Spring 2018 From clustering to EM Byron C. Wallace Clustering

Machine Learning 2 DS 4420 - Spring 2018 From clustering to EM Byron C. Wallace Clustering Four Types of Clustering 1. Centroid-based (K-means, K-medoids) Notion of Clusters: Voronoi tesselation Four Types of Clustering 2. Density-based

799 views • 77 slides
Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative

Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative

LUDWIG- MAXIMILIANS- INSTITUTE DATABASE UNIVERSITT FOR SYSTEMS MNCHEN MNCHEN INFORMATICS INFORMATICS GROUP GROUP Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative Clustering, Multiview

513 views • 9 slides
Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means clustering Hierarchical clustering Incremental clustering Probability-based clustering Self-Organising Maps Classification vs. Clustering

1k views • 67 slides
Density-Based Alternative Explanation Fuzzy Clustering as a Explaining the . . . What If Not

Density-Based Alternative Explanation Fuzzy Clustering as a Explaining the . . . What If Not

Clustering is How We . . . Resulting Clustering . . . Discussion Why Gaussian Kernel: . . . Density-Based Alternative Explanation Fuzzy Clustering as a Explaining the . . . What If Not All . . . First Step to Learning Rules: Towards Fuzzy

437 views • 16 slides
Model-based clustering and data transformations of gene expression data Walter L. Ruzzo

Model-based clustering and data transformations of gene expression data Walter L. Ruzzo

Model-based clustering and data transformations of gene expression data Walter L. Ruzzo University of Washington UW CSE Computational Biology Group Overview Motivation Model-based clustering Validation Summary and

539 views • 34 slides
Data Warehousing and Machine Learning Density-based clustering Thomas D. Nielsen Aalborg

Data Warehousing and Machine Learning Density-based clustering Thomas D. Nielsen Aalborg

Data Warehousing and Machine Learning Density-based clustering Thomas D. Nielsen Aalborg University Department of Computer Science Spring 2008 Density-based Clustering DWML Spring 2008 1 / 29 Densitiy Based Clustering DBSCAN Idea:

880 views • 54 slides
Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering?

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering?

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering? Aykut Erdem May 2016 Hacettepe University Last time K-Means An iterative clustering algorithm - Initialize: Pick K random points as cluster

932 views • 64 slides
Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and

Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and

Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity

772 views • 40 slides
Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns in data, or grouping similar groups of data-points together into clusters . Clustering algorithms for numeric data: Lloyds K-means, EM

688 views • 19 slides
Automated Aspect Recommendation through Clustering-Based Fan-in Analysis Danfeng Zhang , Yao Guo,

Automated Aspect Recommendation through Clustering-Based Fan-in Analysis Danfeng Zhang , Yao Guo,

Automated Aspect Recommendation through Clustering-Based Fan-in Analysis Danfeng Zhang , Yao Guo, Xiangqun Chen Institute of Software, Peking University Talk Outline Background Motivation Clustering-Based Fan-in Analysis (CBFA)

485 views • 30 slides
Clustering DWML, 2007 1/27 Densitiy Based Clustering DBSCAN Idea: identify contiguous regions

Clustering DWML, 2007 1/27 Densitiy Based Clustering DBSCAN Idea: identify contiguous regions

Clustering DWML, 2007 1/27 Densitiy Based Clustering DBSCAN Idea: identify contiguous regions of high density. DWML, 2007 2/27 Densitiy Based Clustering Step 1: classification of points 1.: Choose parameters , k DWML, 2007 3/27 Densitiy

699 views • 50 slides
Week 7 Video 1 Clustering Clustering A type of Structure Discovery algorithm This type of

Week 7 Video 1 Clustering Clustering A type of Structure Discovery algorithm This type of

Week 7 Video 1 Clustering Clustering A type of Structure Discovery algorithm This type of method is also referred to as Dimensionality Reduction , based on a common application Clustering You have a large number of data points You

974 views • 63 slides
Proximity-based Clustering Clustering with no distance information What if one wants to

Proximity-based Clustering Clustering with no distance information What if one wants to

Proximity-based Clustering Clustering with no distance information What if one wants to cluster objects where only similarity relationships are given? Consider the following visualization of relationships between 9 objects Not

372 views • 21 slides
Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics

Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics

Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity and high separation Many

768 views • 43 slides
Model-based clustering with mixed/missing data using the new software MixtComp

Model-based clustering with mixed/missing data using the new software MixtComp

The problem Conditional independent clustering Estimation Clustering with MixtComp Imputation with MixtComp Conclusion Model-based clustering with mixed/missing data using the new software MixtComp

322 views • 29 slides
MapReduce and Streaming Algorithms for Center-Based Clustering in Doubling Spaces Geppino Pucci

MapReduce and Streaming Algorithms for Center-Based Clustering in Doubling Spaces Geppino Pucci

MapReduce and Streaming Algorithms for Center-Based Clustering in Doubling Spaces Geppino Pucci DEI, University of Padova, Italy Based on joint works with: M. Ceccarello, A. Mazzetto, and A. Pietracaprina 1 Center-based clustering

533 views • 32 slides
Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find

Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find

Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find a finite set of representatives that provides good coverage of a complex, possibly infinite, high-dimensional space. Finding meaningful

396 views • 36 slides
Clustering: Hierarchical Clustering and K- Means Clustering Machine

Clustering: Hierarchical Clustering and K- Means Clustering Machine

Clustering: Hierarchical Clustering and K- Means Clustering Machine Learning 10-601B Seyoung Kim Many of these slides are derived from William Cohen,

660 views • 46 slides
Clustering and Dimensionality Reduction Preview Clustering K -means clustering

Clustering and Dimensionality Reduction Preview Clustering K -means clustering

Clustering and Dimensionality Reduction Preview Clustering K -means clustering Mixture models Hierarchical clustering Dimensionality reduction Principal component analysis Multidimensional scaling Isomap

1.61k views • 17 slides
FLOCK: A Density Based Clustering Method for FLOCK: A Density Based Clustering Method for

FLOCK: A Density Based Clustering Method for FLOCK: A Density Based Clustering Method for

FLOCK: A Density Based Clustering Method for FLOCK: A Density Based Clustering Method for Automated Identification and Comparison of Cell Populations in High Dimensional Flow Cell Populations in High Dimensional Flow Cytometry Data Max

1.23k views • 57 slides

More recommend