Motivations Algebraic Manipulation Detection Codes

Slides:



Advertisements
Similar presentations
Alex Chen Nader Shehad Aamir Virani Erik Welsh
Advertisements

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padro,
Efficient Non-Malleable Codes and Key-derivations against Poly-size Tampering Circuits PRATYAY MUKHERJEE (Aarhus University) Joint work with Sebastian.
Circuits Resilient to Additive Manipulation with Applications to Secure Computation Yuval Ishai Technion Daniel Genkin Manoj Prabhakaran Amit Sahai Eran.
Cyclic Code.
Error Control Code.
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Capacity of Wireless Channels
II. Linear Block Codes. © Tallal Elshabrawy 2 Last Lecture H Matrix and Calculation of d min Error Detection Capability Error Correction Capability Error.
Maximum Likelihood Sequence Detection (MLSD) and the Viterbi Algorithm
TAMPER DETECTION AND NON-MALLEABLE CODES Daniel Wichs (Northeastern U)
Strong Error Detection for Control Units Against Advanced Attackers Kahraman Daglar Akdemir Advisor: Berk Sunar Electrical and Computer Engineering MOTIVATION.
Lossy Source Coding under a Maximum Distortion Constraint with Decoder Side- Information Jayanth Nayak 1, Ertem Tuncel 2, and Kenneth Rose 1 1 University.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Error Detection and Correction Rizwan Rehman Centre for Computer Studies Dibrugarh University.
When rate of interferer’s codebook small Does not place burden for destination to decode interference When rate of interferer’s codebook large Treating.
Coding Theory. p2. Why encode data? Three reasons to encode data that is about to be transmitted(through space) or stored(in a computer): 1. For efficiency.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
ENEE244-02xx Digital Logic Design Lecture 3. Announcements Homework 1 due next class (Thursday, September 11) First recitation quiz will be next Monday,
Introduction to Coding Theory. p2. Outline [1] Introduction [2] Basic assumptions [3] Correcting and detecting error patterns [4] Information rate [5]
1 Yuan Luo Xi’an Jan Optimum Distance Profiles of Linear Block Codes Shanghai Jiao Tong University.
Error Control Code. Widely used in many areas, like communications, DVD, data storage… In communications, because of noise, you can never be sure that.
DIGITAL COMMUNICATIONS Linear Block Codes
10.1 Chapter 10 Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Cryptography Against Physical Attacks Dana Dachman-Soled University of Maryland
TAMPER DETECTION AND NON-MALLEABLE CODES Daniel Wichs (Northeastern U)
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Qubits, von Neumann Measurement, Quantum.
1 Reliability-Based SD Decoding Not applicable to only graph-based codes May even help with some algebraic structure SD alternative to trellis decoding.
Sami Khorbotly, Ph.D., IEEE member Assistant Professor
Exercise in the previous class (1) Define (one of) (15, 11) Hamming code: construct a parity check matrix, and determine the corresponding generator matrix.
Joint Decoding on the OR Channel Communication System Laboratory UCLA Graduate School of Engineering - Electrical Engineering Program Communication Systems.
Memory Protection through Dynamic Access Control Kun Zhang, Tao Zhang and Santosh Pande College of Computing Georgia Institute of Technology.
Big-O. Speed as function Function relating input size to execution time – f(n) = steps where n = length of array f(n) = 4(n-1) + 3 = 4n – 1.
ESE532: System-on-a-Chip Architecture
The Viterbi Decoding Algorithm
Coexistence Among Cryptography and Noisy Data Theory and Applications
Swamynathan.S.M AP/ECE/SNSCT
Sublinear-Time Error-Correction and Error-Detection
Sublinear-Time Error-Correction and Error-Detection
Logic and Computer Design Fundamentals
Processor Architecture: Introduction to RISC Datapath (MIPS and Nios II) CSCE 230.
Fei Li Jinjun Xiong University of Wisconsin-Madison
Chapter 10 Error Detection And Correction
Welcome to the presentation. Linear Block Codes Almost all block codes used today belong to a subset called linear block codes. The exclusive OR of two.
A Tamper and Leakage Resilient von Neumann Architecture
Unknown Input Attacks in the Parallel Setting Improving the Security of the CHES 2012 Leakage Resilient PRF Marcel Medwed François-Xavier Standaert Ventzislav.
FIGURE 4.1 Block diagram of combinational circuit
RS – Reed Solomon List Decoding.
Channel coding architectures for OCDMA
Jamming Resistant Encoding
Standard Array.
Information-Theoretic Study of Optical Multiple Access
Cyclic Code.
Distributed Compression For Binary Symetric Channels
Error control coding for wireless communication technologies
Miguel Griot, Andres I. Vila Casado, and Richard D. Wesel
Unequal Error Protection: Application and Performance Limits
Software Security.
Information Theoretical Analysis of Digital Watermarking
A New Method for Tamper Detection and Recovery
Theory of Information Lecture 13
IV. Convolutional Codes
Lecture 18 The Main Coding Theory Problem (Section 4.7)
Zeev Dvir (Princeton) Shachar Lovett (IAS)
Presentation transcript:

Motivations Algebraic Manipulation Detection Codes Steps to break any protections based on single error detecting codes: Select an input, observe y Investigating the code, select e=(ey,ef) so that for the codeword (y, f(y)), also belongs to the code. Inject faults manifested as e Codes that can still provide guaranteed level of protection even if the attacker can control the error as well as the input to the device are called algebraic manipulation codes. Strongest Attacker Model! Any protection based on single error detecting code won’t work! 2018/12/4 1

General Architecture Algebraic Manipulation Detection Codes Talk about attacker capability 2018/12/4 2

Definitions Algebraic Manipulation Detection Codes The codewords of the AMD code are in the format of .. We define the security kernel of the code as … 2018/12/4 3

Worst Case Error Masking Probability Algebraic Manipulation Detection Codes Worst Case Error Masking Probability The error detecting capability of AMD codes can be characterized using Q(y,e) 2018/12/4 4

Algebraic Manipulation Detection Codes Lower Bounds Can you list more classical bounds that can be used to derive dq(2m,M)? 2018/12/4 5

Algebraic Manipulation Detection Codes 2018/12/4 6

Algebraic Manipulation Detection Codes Example 2018/12/4 7

Algebraic Manipulation Detection Codes Example: r=1 2018/12/4 8

Algebraic Manipulation Detection Codes Special Cases When b=1 and y is always distorted, A(x) can be removed When t=1, the code is optimal! Encoding can be based on multivariate Horner Scheme! Close to optimal complexity! 2018/12/4 9

Algebraic Manipulation Detection Codes 2018/12/4 10

Algebraic Manipulation Detection Codes 2018/12/4 11

Algebraic Manipulation Detection Codes Example. Let t = b = 2 and assume r is large enough. Then the resulting code is a (7r; 2r; r) AMD code. At most 8 multipliers and 7 adders in GF(2r) are required for the encoding or the decoding. The critical path of the encoder contains 4 multipliers and 4 adders in GF(2^r).

Encoder Architecture for the (7r; 2r; r) AMD Code