Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

5.1 Real Vector Spaces.
8.3 Inverse Linear Transformations
1 Chapter 4 Experiments with Blocking Factors The Randomized Complete Block Design Nuisance factor: a design factor that probably has an effect.
Chapter 4 Randomized Blocks, Latin Squares, and Related Designs
CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
MUBs and some other quantum designs Aleksandrs Belovs and Juris Smotrovs.
Probability and Statistics Dr. Saeid Moloudzadeh Sample Space and Events 1 Contents Descriptive Statistics Axioms of Probability Combinatorial.
Collusion-resistant fingerprinting for multimedia Wade Trappe, Min Wu, K.J. Ray Liu.
Chapter 8-3 Markov Random Fields 1. Topics 1. Introduction 1. Undirected Graphical Models 2. Terminology 2. Conditional Independence 3. Factorization.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Contents Introduction Related problems Constructions –Welch construction –Lempel construction –Golomb construction Special properties –Periodicity –Nonattacking.
Contents Distributed Sensor Networks (DSNs) Key Predistribution Schemes – KPSs A Set System The 3 phases Metrics for the Evaluation of KPSs Configurations.
Orthogonality and Least Squares
Establishing Pairwise Keys in Distributed Sensor Networks Donggang Liu, Peng Ning Jason Buckingham CSCI 7143: Secure Sensor Networks October 12, 2004.
Subspaces, Basis, Dimension, Rank
Stats & Linear Models.
Quantum One: Lecture 8. Continuously Indexed Basis Sets.
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Monday, 26 January 2004 William H. Hsu Department of.
Chapter 5: The Orthogonality and Least Squares
Linear Pair Postulate If two angles form a linear pair then they are supplementary.
Copyright, Yogesh Malhotra, PhD, 2013www.yogeshmalhotra.com SPECIAL PURPOSE FACTORING ALGORITHMS Special Purpose Factoring Algorithms For special class.
Equidistant Codes in the Grassmannian Netanel Raviv Equidistant Codes in the Grassmannian Netanel Raviv June Joint work with: Prof. Tuvi Etzion Technion,
Vectors CHAPTER 7. Ch7_2 Contents  7.1 Vectors in 2-Space 7.1 Vectors in 2-Space  7.2 Vectors in 3-Space 7.2 Vectors in 3-Space  7.3 Dot Product 7.3.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
13 B Lines in 2D and 3D. The vector AB and the vector equation of the line AB are very different things. x x x x The line AB is a line passing through.
Geometry 1-1 Understanding Points, Lines, and Planes.
Optimal XOR Hashing for a Linearly Distributed Address Lookup in Computer Networks Christopher Martinez, Wei-Ming Lin, Parimal Patel The University of.
Efficient Key Predistribution for Grid – Based Wireless Sensor Networks.
MAT 360 Lecture 4 Projective and affine planes. Undefined terms  Point  Line  Incidence.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Lines in the plane, slopes, and Euler’s formula by Tal Harel
CSE 185 Introduction to Computer Vision Face Recognition.
Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition
1. Vector Space 24. February Real Numbers R. Let us review the structure of the set of real numbers (real line) R. In particular, consider addition.
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
Sixth lecture Concepts of Probabilities. Random Experiment Can be repeated (theoretically) an infinite number of times Has a well-defined set of possible.
Projective Geometry Hu Zhan Yi. Entities At Infinity The ordinary space in which we lie is Euclidean space. The parallel lines usually do not intersect.
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
Nasrin Soltankhah Department of Mathematical SciencesDepartment of Mathematical Sciences Alzahra University Tehran, I.R. IranTehran, I.R. Iran.
Parallelisms of PG(3,5) with automorphisms of order 13 Svetlana Topalova, Stela Zhelezova Institute of Mathematics and Informatics, BAS,Bulgaria.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
SAT Prep. Postulates and Theorems Relating Points, Lines, and Planes Use postulates and theorems relating points, lines, and planes.
Parallelisms of PG(3,4) with automorphisms of order 7 Svetlana Topalova, Stela Zhelezova Institute of Mathematics and Informatics, BAS,Bulgaria.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
Constructing the Tits Ovoid from an Elliptic Quadric Bill Cherowitzo Univ. of Colorado at Denver (UCDHSC-DDC) July 1, 2006.
3D Lines and Planes.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Combinatorial Designs and Their Applications ( 組合設計及其應用 ) 應用數學系 傅恆霖.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
Lecture 7 Vector Space Last Time - Properties of Determinants
8.2 Kernel And Range.
Lines and Planes in Space
Two-view geometry Computer Vision Spring 2018, Lecture 10
RECORD. RECORD Subspaces of Vector Spaces: Check to see if there are any properties inherited from V:
RECORD. RECORD A Vector Space: the Definition.
Linear Algebra Chapter 4 Vector Spaces.
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Linear Algebra Lecture 20.
Vector Spaces, Subspaces
Linear Vector Space and Matrix Mechanics
Locality In Distributed Graph Algorithms
Presentation transcript:

Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis

Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis

Balanced Incomplete Block Design (BIBD) There are v distinct object There are b blocks Each block contains exactly k distinct objects Each object occurs in exactly r different blocks Every pair of distinct object occurs together in exactly blocks Can be expressed as or

Symmetric BIBD (or Symmetric Design) A BIBD is called Symmetric BIBD (or Symmetric Design) when b=v and therefore r=k Symmetric BIBD has 4 properties: –Every block contains k=r objects –Every object occurs in r=k blocks –Every pair of object occurs in blocks –Every pair of blocks intersects on objects

Example or There are b=7 blocks and each one contains k=3 objects Every objects occurs in r=3 blocks Every pair of distinct objects occurs in Blocks Every pair of blocks intersects in objects

Example Cont’ Based on a construction algorithm the blocks are:

Projective Plane Consist of finite set P of points and a set of subsets of P, called lines A Projective Plane of order q (q>1) has 4 properties –Every line contains exactly q+1 points –Every point occurs on exactly q+1 lines –There are exactly points –There are exactly lines

Projective Plane cont’ Theorem: If we consider lines as blocks and points as objects, then Projective Plane of order q is a Symmetric BIBD with parameters: Theorem: For every prime power q>1 there exist a Symmetric BIBD (Projective Plane of order q)

Complementary Design Theorem: If is a symmetric BIBD, then is also a symmetric BIBD Example: Consider Complementary Design of this design is: with the following blocks:

Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis

Projective Space PG(d,q) Dimension d Order q Constructed from the vector space of dimension d+1 over the field finite F –Objects are subspaces of the vector space –Two objects are incident if one contains the other

Projective Space PG(d,q) Subspace dimensions –Point if dimension 1 –Line if dimension 2 –Hyperplane if dimension d Order of a projective space is one less than the number of points incident in a line

Partial Linear Space Arrangement of objects into subsets called lines Properties –Every line is incident with at least two points –Any two points are incident with at most one line

Incidence Structure includes –Set of points –Set of lines –Symmetric incidence relation

Point-Line Incidence Relation (p,L) is in I if and only if they are incident in the space

Point-Line Incidence Relation Axioms –Two distinct points are incident with at most one line. –Two distinct lines are incident with at most one point

Generalized Quadrangle GQ(s,t) is a subset of a special Partial Linear Space subset called Partial Geometry Incidence structure S = (P,B,I) –P set of points –B set of lines –I symmetric point-line incidence relation satisfying: A The above Axioms B Each point is incident with t+1 lines (t>=1) C Each line is incident with s+1 points (s>=1)

Generalized Quadrangle I point-line incidence relation satisfying D

GQ(s,t) v = (s+1)(st+1) points b = (t+1)(st+1) lines Each line includes (s+1) points and each point appears in (t+1) lines

3 known GQ’s GQ(q,q) from PG(4,q) GQ(q,q²) from PG(5,q) GQ(q²,q³) from PG(4,q²) In GQ(q,q) –b = v = (q+1)(q²+1)

Example GQ(2,2) for q = 2 v = b = (2+1)(2*2+1) = 15 Each block contains 2+1 objects Each object is contained in 2+1 blocks

Example cont.

Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis

Reminder – A Distributed Sensor Network (DSN) There are N sensor nodes Each sensor has a key-chain of k keys Keys are selected from a set P of key-pool 2 sensor nodes need to have q keys in common in their key-chain to secure their communication

Mapping from Symmetric Design to Key Distribution

Construction There are several ways to construct Symmetric BIBD of the form We will use complete sets of Mutually Orthogonal and Latin Squares (MOLS) to construct Symmetric BIBD (which can be converted to a projective plane of order q)

Construction

Mapping from GQ to Key Distribution There are t+1 lines passing through a point Each line has s+1 points Therefore, each line shares a point with exactly t(s+1) other lines Moreover, if 2 lines A,B do not share a point there are s+1 distinct lines which share a point with both.

Mapping from GQ to Key Distribution Cont’ In terms of Key Distribution that means: –A block shares a key with t(s+1) other blocks –If 2 blocks do not share a key, there are s+1 other blocks sharing a key with both

Parameters

Construction

Contents Balanced Incomplete Block Design (BIBD) & Projective Plane Generalized Quadrangle (GQ) Mapping and Construction Analysis

Analysis SD In a Symmetric Design any pair of blocks share exactly one object Key share probability between 2 nodes Average Key-Path Length

Analysis SD Resilience contradicts with high probability of key sharing Resilience is compromised Adversary best case – captures q+1 nodes Adversary worst case – captures q²+1 nodes

Analysis SD The probability that a link is compromised when an attacker captures key-chains

Analysis GQ In a GQ(s,t) there are b = (t+1)(st+1) lines and a line intersects with t(s+1) other lines –Each block shares exactly one object with t(s+1) other blocks –How many blocks does a block share n objects with?

Analysis GQ Probability two blocks share an object Adversary worst case –Captures st² + st +1 nodes Adversary best case –Captures t+1 nodes

Prominent properties SD highest number of object share GQ(q,q²) highest number of blocks for fixed block size GQ(q²,q³) smallest block size for fixed number of blocks and has highest resilience

Analysis