Faster Malicious 2-party Secure Computation with Online/Offline Dual Execution. Peter Rindal Mike Rosulek

Size: px
Start display at page:

Download "Faster Malicious 2-party Secure Computation with Online/Offline Dual Execution. Peter Rindal Mike Rosulek"

Transcription

1 Faster Malicious 2-part Secure Computation with Online/Oline Dual Eecution Peter Rindal Mike Rosulek

2 2 Part Computation Real Protocol (, ) Ideal Functionalit (, )

3 2 Part Computation Real Protocol (, ) Secure against malicious adversaries De (simpliied): S Real π,, S S(,, (, ))

4 Applications 2-part Secure Computation Applications Private database quering Database, (, ) Quer Joint machine learning Datasets,, Model = (, ) Secure auctions Bids, Winning bid = (, )

5 Yao s Protocol garbled Yao OT, garble (, ), garbled (, ) (, ) de = garbled, Bob knows Securit properties: Privac Alice learn no more than (, ) Authenticit Alice can not guess an output encoding other than (, )

6 Yao s Protocol g g() Yao g Problems with malicious Adversaries The circuit ma not be correctl constructed E.g. g Ma violate privac and correctness Not alwas detectable

7 Dual Eecution [MohasselFranklin06], B Yao (, ) (, ) Yao, A First Yao secure against Alice. Second Yao secure against Bob

8 Dual Eecution [MohasselFranklin06] (, ) Yao A,,, B B (, ) Yao, A, AB Eq?, AB Deine common encoding: es / no de z AB = z A z B

9 Dual Eecution [MohasselFranklin06] g Yao A, g, B B g (, ) Yao, A g AB Eq?, AB Deine common encoding: de z AB = z A z B es / no Leaks a single bit!? g =, Guaranteed Correctness

10 Improved Dual Eecution [KolesnikovMohasselRivaRosulek15] (, ) AB Eq? (, ) AB Send s circuits Check some or correctness es / no

11 Improved Dual Eecution [KolesnikovMohasselRivaRosulek15] g 1 g z 1 AB, (, ) AB Eq? PSI (, ) AB Intersection Send s circuits Check some or correctness (, ) Use Private Set Intersection (PSI) to reconcile

12 Improved Dual Eecution [KolesnikovMohasselRivaRosulek15] g 1 g 2 g z 1 AB, z 2 AB Eq? PSI (, ) AB Intersection Send s circuits Check some or correctness (, ) or Use Private Set Intersection (PSI) to reconcile

13 Improved Dual Eecution [KolesnikovMohasselRivaRosulek15] g 1 g 2 g z 1 AB, z 2 AB (, ) AB Eq? PSI Send s circuits (, ) or Leaks a bit i all eval. Circuit are bad: Check some or correctness i g i, Use Private Set Intersection (PSI) to reconcile Pr leak a bit = 2 s

14 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] Want to perorm N eecutions o Construct enough circuits or all N eecutions

15 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] Want to perorm N eecutions o Construct enough circuits or all N eecutions Check some or correctness

16 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] Want to perorm N eecutions o Construct enough circuits or all N eecutions Check some or correctness Randoml map the rest into bins Bin size o s log N instead o s E.g. 10 improvement

17 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] Want to perorm N eecutions o Construct enough circuits or all N eecutions Check some or correctness Randoml map the rest into bins Bin size o s log N instead o s E.g. 10 improvement

18 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] Want to perorm N eecutions o Construct enough circuits or all N eecutions Check some or correctness Randoml map the rest into bins Bin size o s log N instead o s E.g. 10 improvement

19 Online Oline [LindellRiva14,NeilsenOrlandi08,RRosulek16] PSI (, ) Use one bin per evaluation

20 Challenge #1: Input Consistenc [RRosulek16] How to ensure Bob used the same in all circuits? PSI

21 Challenge #1: Input Consistenc [RRosulek16] How to ensure Bob used the same in all circuits? Circuit generated b Alice Bob receives input via OT [eas] PSI

22 Challenge #1: Input Consistenc [RRosulek16] How to ensure Bob used the same in all circuits? Circuit generated b Alice Bob receives input via OT [eas] PSI Circuit generated b Bob [hard]

23 Challenge #1: Input Consistenc [RRosulek16] How to ensure Bob used the same in all circuits? Circuit generated b Alice Bob receives input via OT [eas] PSI Circuit generated b Bob [hard] In the oline, Bob tells Alice the relationship between the two arrows Alice check in the cut and choose

24 Challenge #1: Input Consistenc [RRosulek16] How to ensure Bob used the same in all circuits? Circuit generated b Alice Bob receives input via OT [eas] PSI Circuit generated b Bob [hard] In the oline, Bob tells Alice the relationship between the two arrows Alice check in the cut and choose Consistent with the relationship at least o one o Bob s circuits uses Requires no crpto operations

25 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test Fastest PSI protocol [PinkasSchneiderZohner14] PSI X Y

26 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test Fastest PSI protocol [PinkasSchneiderZohner14] Issues: Not malicious secure in general Can not be simulated PSI X Y

27 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test Fastest PSI protocol [PinkasSchneiderZohner14] Issues: Not malicious secure in general Can not be simulated E: singleton set PSI { a X = b a c

28 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test Fastest PSI protocol [PinkasSchneiderZohner14] Issues: Not malicious secure in general Can not be simulated E: singleton set PSI { a X = b b c a

29 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test Fastest PSI protocol [PinkasSchneiderZohner14] Issues: Not malicious secure in general Can not be simulated E: singleton set PSI { a X = b c c b a

30 Challenge #2: Private Set Intersection (PSI) [RRosulek16] Build PSI rom Private Equalit Test [PinkasSchneiderZohner14] Fastest PSI protocol Issues: Not malicious secure in general Can not be simulated PSI E: singleton set Ideal: Bob onl knows one valid PSI input (, ) Simulator doesn t need to etract Bob input! Just test i it contains (, ) z 1 z 2 z 3 (, )

31 Perormance Function [RRosulek16] [LindellRiva15] [DamgårdZakarias15] Oline Online Oline Online Oline Online AES 5. 1 ms 1. 3 ms 74 ms 7 ms high? 6 ms SHA ms 8. 1 ms 206 ms 33 ms - - Amortized cost or N = 1,024 evaluations Amazon c4.8large = 36 core, 64GB RAM Statistical securit κ = 40 Maimum throughput: 0.26 ms / AES block (3800+ Hz) [DamgårdZakarias15] report 0.4 ms

32 Total Protocol Times or AES 100,000,000 [PSSW] 18 min 1,000,000 10,000 [KSS] 3.4 sec [FN] 0.8 sec [LR15] 81 ms 100 [RR16] 6 ms

33 Total Protocol Times or AES 100,000,000 [PSSW] 18 min 1,000,000 10,000 [KSS] 3.4 sec [FN] 0.8 sec [LR15] 81 ms 100 [RR16] 6 ms

34 Total Protocol Times or AES 100,000,000 [PSSW] 18 min 64-node cluster Consumer GPU 1,000,000 10,000 [KSS] 3.4 sec [FN] 0.8 sec AWS c4.8large [LR15] 81 ms 100 [RR16] 6 ms

35 Summar Online-oline dual eecution Faster 2PC with malicious securit to date: 1.3ms AES Some securit advantages over classic cut-and-choose Future Work: Hbrid protocols: combine [RRosulek16] with [DamgårdZakarias15] ast oline unction independent oline Transer advances rom online-oline to single eecution setting

36 The End Thanks Faster Malicious 2-part Secure Computation with Online/Oline Dual Eecution github.com/osu-crpto/batchduale Peter Rindal Mike Rosulek

Efficient Constant-Round Multiparty Computation

Efficient Constant-Round Multiparty Computation Efficient Constant-Round Multiparty Computation Yehuda Lindell Bar-Ilan University Based on joint works with Aner Ben-Efraim, Eran Omri, Benny Pinkas, Nigel Smart, Eduardo Soria-Vasquez and Avishai Yanay

More information

Secure Function Evaluation

Secure Function Evaluation Secure Function Evaluation 1) Use cryptography to securely compute a function/program. 2) Secure means a) Participant s inputs stay secret even though they are used in the computation. b) No participant

More information

Secure Distributed Computation on Private Inputs

Secure Distributed Computation on Private Inputs Secure Distributed Computation on Private Inputs David Pointcheval ENS - CNRS - INRIA Foundations & Practice of Security Clermont-Ferrand, France - October 27th, 2015 The Cloud David Pointcheval Introduction

More information

Big Data Framework for Synchrophasor Data Analysis

Big Data Framework for Synchrophasor Data Analysis Big Data Framework for Synchrophasor Data Analysis Pavel Etingov, Jason Hou, Huiying Ren, Heng Wang, Troy Zuroske, and Dimitri Zarzhitsky Pacific Northwest National Laboratory North American Synchrophasor

More information

Non-Interactive Secure 2PC in the Offline/Online and Batch Settings

Non-Interactive Secure 2PC in the Offline/Online and Batch Settings Non-Interactive Secure 2PC in the Offline/Online and Batch Settings Payman Mohassel 1 and Mike Rosulek 2, 1 Visa Research. pmohasse@visa.com 2 Oregon State University. rosulekm@eecs.oregonstate.edu Abstract.

More information

Efficient Privacy-Preserving Biometric Identification

Efficient Privacy-Preserving Biometric Identification Efficient Privacy-Preserving Biometric Identification Yan Huang Lior Malka David Evans Jonathan Katz http://www.mightbeevil.org/secure-biometrics/ Feb 9, 2011 Motivating Scenario: Private No-Fly Checking

More information

EUP A, 30V, 340KHz Synchronous Step-Down Converter DESCRIPTION FEATURES APPLICATIONS. Typical Application Circuit

EUP A, 30V, 340KHz Synchronous Step-Down Converter DESCRIPTION FEATURES APPLICATIONS. Typical Application Circuit 2A, 30, 340KHz ynchronous tep-down Converter DECRIPTION The is a synchronous current mode buck regulator capable o driving 2A continuous load current with excellent line and load regulation. The can operate

More information

EUP3484A. 3A, 30V, 340KHz Synchronous Step-Down Converter DESCRIPTION FEATURES APPLICATIONS. Typical Application Circuit

EUP3484A. 3A, 30V, 340KHz Synchronous Step-Down Converter DESCRIPTION FEATURES APPLICATIONS. Typical Application Circuit 3A, 30, 340KHz ynchronous tep-down Converter DECRIPTION The is a synchronous current mode buck regulator capable o driving 3A continuous load current with excellent line and load regulation. The can operate

More information

6.976 High Speed Communication Circuits and Systems Lecture 16 Noise in Integer-N Frequency Synthesizers

6.976 High Speed Communication Circuits and Systems Lecture 16 Noise in Integer-N Frequency Synthesizers 6.976 High Speed Communication Circuits and Systems Lecture 16 in Integer-N Frequency Synthesizers Michael Perrott Massachusetts Institute o Technology Copyright 23 by Michael H. Perrott Frequency Synthesizer

More information

3.6 Intersymbol interference. 1 Your site here

3.6 Intersymbol interference. 1 Your site here 3.6 Intersymbol intererence 1 3.6 Intersymbol intererence what is intersymbol intererence and what cause ISI 1. The absolute bandwidth o rectangular multilevel pulses is ininite. The channels bandwidth

More information

ISSUE: April Fig. 1. Simplified block diagram of power supply voltage loop.

ISSUE: April Fig. 1. Simplified block diagram of power supply voltage loop. ISSUE: April 200 Why Struggle with Loop ompensation? by Michael O Loughlin, Texas Instruments, Dallas, TX In the power supply design industry, engineers sometimes have trouble compensating the control

More information

JICE: Joint Data Compression and Encryption for Wireless Energy Auditing Networks

JICE: Joint Data Compression and Encryption for Wireless Energy Auditing Networks JICE: Joint Data Compression and Encryption for Wireless Energy Auditing Networks Sheng-Yuan Chiu 1,2, Hoang Hai Nguyen 1, Rui Tan 1, David K.Y. Yau 1,3,Deokwoo Jung 1 1 Advanced Digital Science Center,

More information

Finding Loop Gain in Circuits with Embedded Loops

Finding Loop Gain in Circuits with Embedded Loops Finding oop Gain in Circuits with Embedded oops Sstematic pproach to Multiple-oop nalsis bstract Stabilit analsis in eedback sstems is complicated b non-ideal behaior o circuit elements and b circuit topolog.

More information

Preprint. This is the submitted version of a paper published in Electronic environment.

Preprint.   This is the submitted version of a paper published in Electronic environment. http://www.diva-portal.org Preprint This is the submitted version o a paper published in Electronic environment. Citation or the original published paper (version o record): Stranneb, D. (0) A Primer on

More information

Introduction to Cryptography CS 355

Introduction to Cryptography CS 355 Introduction to Cryptography CS 355 Lecture 25 Mental Poker And Semantic Security CS 355 Fall 2005 / Lecture 25 1 Lecture Outline Review of number theory The Mental Poker Protocol Semantic security Semantic

More information

CS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec

CS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec CS885 Reinforcement Learning Lecture 13c: June 13, 2018 Adversarial Search [RusNor] Sec. 5.1-5.4 CS885 Spring 2018 Pascal Poupart 1 Outline Minimax search Evaluation functions Alpha-beta pruning CS885

More information

Shannon Information Theory

Shannon Information Theory Comm. 5: Communication Theor Lecture Shannon Information Theor -Binar Erasure Channel, Binar Smmetric channel, Channel Caacit, Shannon Caacit Noiseless Channel P P P Noiseless Channel P is the robabilit

More information

Drum Leveler User Manual

Drum Leveler User Manual Drum Leveler User Manual 1 Overview Drum Leveler is a new beat detection based downward and upward compressor/expander. By selectively applying gain to single drum beats, Drum Leveler easily achieves the

More information

PMU Big Data Analysis Based on the SPARK Machine Learning Framework

PMU Big Data Analysis Based on the SPARK Machine Learning Framework PNNL-SA-126200 PMU Big Data Analysis Based on the SPARK Machine Learning Framework Pavel Etingov WECC Joint Synchronized Information Subcommittee meeting May 23-25 2017, Salt Lake City, UT May 18, 2017

More information

Adversarial Search. CMPSCI 383 September 29, 2011

Adversarial Search. CMPSCI 383 September 29, 2011 Adversarial Search CMPSCI 383 September 29, 2011 1 Why are games interesting to AI? Simple to represent and reason about Must consider the moves of an adversary Time constraints Russell & Norvig say: Games,

More information

Lecture 39: GMW Protocol GMW

Lecture 39: GMW Protocol GMW Lecture 39: Protocol Recall Last lecture we saw that we can securely compute any function using oblivious transfer (which can be constructed from the RSA assumption) However, the protocol is efficient

More information

Distributed Settlers of Catan

Distributed Settlers of Catan Distributed Settlers of Catan Hassan Alsibyani, Tim Mickel, Willy Vasquez, Xiaoyue Zhang Massachusetts Institute of Technology May 15, 2014 Abstract Settlers of Catan is a popular multiplayer board game

More information

Addressing Software Security and Mitigations in the Life Cycle

Addressing Software Security and Mitigations in the Life Cycle Addressing Software Securit and Mitigations in the Life Ccle David Gilliam & John Powell California Institute of Technolog, Jet Propulsion Laborator david.p.gilliam@jpl.nasa.gov, john.d.powell@jpl.nasa.gov

More information

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Optimizing Semi-Honest Secure Multiparty Computation for the Internet Optimizing Semi-Honest Secure Multiparty Computation for the Internet Aner Ben-Efraim Dept. of Computer Science Ben-Gurion University, Israel anermosh@post.bgu.ac.il Yehuda Lindell Dept. of Computer Science

More information

CS 331: Artificial Intelligence Adversarial Search II. Outline

CS 331: Artificial Intelligence Adversarial Search II. Outline CS 331: Artificial Intelligence Adversarial Search II 1 Outline 1. Evaluation Functions 2. State-of-the-art game playing programs 3. 2 player zero-sum finite stochastic games of perfect information 2 1

More information

Repelling Sybil-type attacks in wireless ad hoc systems

Repelling Sybil-type attacks in wireless ad hoc systems Outline Repelling Sybil-type attacks in wireless ad hoc systems Marek Klonowski Michał Koza Mirosław Kutyłowski Institute of Mathematics and Computer Science, Wrocław University of Technology ACISP 2,

More information

Wireless Network Security Spring 2014

Wireless Network Security Spring 2014 Wireless Network Security 14-814 Spring 2014 Patrick Tague Class #5 Jamming 2014 Patrick Tague 1 Travel to Pgh: Announcements I'll be on the other side of the camera on Feb 4 Let me know if you'd like

More information

Perkin Elmer Envision 2100 Multilabel Reader

Perkin Elmer Envision 2100 Multilabel Reader www.ietltd.com Proudly serving laboratories worldwide since 1979 CALL 001.847.913.0777 for Refurbished & Certified Lab Equipment Perkin Elmer Envision 2100 Multilabel Reader Key features Modular design

More information

PLANNING AND DESIGN OF FRONT-END FILTERS

PLANNING AND DESIGN OF FRONT-END FILTERS PLANNING AND DESIGN OF FRONT-END FILTERS AND DIPLEXERS FOR RADIO LINK APPLICATIONS Kjetil Folgerø and Jan Kocba Nera Networks AS, N-52 Bergen, NORWAY. Email: ko@nera.no, jko@nera.no Abstract High capacity

More information

Wireless Network Security Spring 2016

Wireless Network Security Spring 2016 Wireless Network Security Spring 2016 Patrick Tague Class #4 Physical Layer Threats; Jamming 2016 Patrick Tague 1 Class #4 PHY layer basics and threats Jamming 2016 Patrick Tague 2 PHY 2016 Patrick Tague

More information

CSE 100: RED-BLACK TREES

CSE 100: RED-BLACK TREES 1 CSE 100: RED-BLACK TREES 2 Red-Black Trees 1 70 10 20 60 8 6 80 90 40 1. Nodes are either red or black 2. Root is always black 3. If a node is red, all it s children must be black 4. For every node X,

More information

Games of Skill ANSWERS Lesson 1 of 9, work in pairs

Games of Skill ANSWERS Lesson 1 of 9, work in pairs Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the

More information

Game Playing State of the Art

Game Playing State of the Art Game Playing State of the Art Checkers: Chinook ended 40 year reign of human world champion Marion Tinsley in 1994. Used an endgame database defining perfect play for all positions involving 8 or fewer

More information

Ayonix-APS. World s fastest 3D Face surveillance application. Feb.13 th, 2017

Ayonix-APS. World s fastest 3D Face surveillance application. Feb.13 th, 2017 Ayonix-APS World s fastest 3D Face surveillance application Feb.13 th, 2017 What is APS Ayonix Public Security(APS) is a All-in-one Face recognition product which recognizes people from IP cameras, Image

More information

ECG HOLTER INtUItIVe USeR INteRFAce Interactive Graphs Interactive Histograms navigation by extremes Fully Customizable R E LT O H CG E

ECG HOLTER INtUItIVe USeR INteRFAce Interactive Graphs Interactive Histograms navigation by extremes Fully Customizable R E LT O H CG E ECG HOLTER new 2 ecg Holter NEW POSSIBILITIES IN HOLTER DIAGNOSTICS btl ecg Holter The BTL ECG Holter satisfies the needs of the most demanding ECG experts, while at the same time making their work both

More information

Outline / Wireless Networks and Applications Lecture 5: Physical Layer Signal Propagation and Modulation

Outline / Wireless Networks and Applications Lecture 5: Physical Layer Signal Propagation and Modulation Outline 18-452/18-750 Wireless Networks and Applications Lecture 5: Physical Layer Signal Propagation and Modulation Peter Steenkiste Carnegie Mellon University Spring Semester 2017 http://www.cs.cmu.edu/~prs/wirelesss17/

More information

Ben Baker. Sponsored by:

Ben Baker. Sponsored by: Ben Baker Sponsored by: Background Agenda GPU Computing Digital Image Processing at FamilySearch Potential GPU based solutions Performance Testing Results Conclusions and Future Work 2 CPU vs. GPU Architecture

More information

Digital Image Processing Chapter 3: Image Enhancement in the Spatial Domain

Digital Image Processing Chapter 3: Image Enhancement in the Spatial Domain Digital Image Processing Chapter 3: Image Enhancement in the Spatial Domain Principle Objective o Enhancement Process an image so that the result will be more suitable than the original image or a speciic

More information

A technique for noise measurement optimization with spectrum analyzers

A technique for noise measurement optimization with spectrum analyzers Preprint typeset in JINST style - HYPER VERSION A technique or noise measurement optimization with spectrum analyzers P. Carniti a,b, L. Cassina a,b, C. Gotti a,b, M. Maino a,b and G. Pessina a,b a INFN

More information

Lecture 8: Media Access Control. CSE 123: Computer Networks Stefan Savage

Lecture 8: Media Access Control. CSE 123: Computer Networks Stefan Savage Lecture 8: Media Access Control CSE 123: Computer Networks Stefan Savage Overview Methods to share physical media: multiple access Fixed partitioning Random access Channelizing mechanisms Contention-based

More information

Enter the Maths Zone: Algebra Net NotesPLUS

Enter the Maths Zone: Algebra Net NotesPLUS Programme Worksheet : Palindromic Pursuits Take a number. Reverse it. Add the two numbers. Reverse the answer. Add the two numbers. Reverse the answer. Add the two numbers. Reverse the answer. Add the

More information

MBC DG GUI MBC INTERFACE

MBC DG GUI MBC INTERFACE MBC DG GUI MBC INTERFACE User Manual Version 2.6 Table des matières Interface - Introduction... 3 Interface - Setup... 3 Minimum Computer Requirements... 3 Software installation... 3 Hardware Setup...

More information

Privacy at the communication layer

Privacy at the communication layer Privacy at the communication layer The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability David Chaum 1988 CS-721 Carmela Troncoso http://carmelatroncoso.com/ (borrowed slides

More information

CS 188: Artificial Intelligence Spring 2007

CS 188: Artificial Intelligence Spring 2007 CS 188: Artificial Intelligence Spring 2007 Lecture 7: CSP-II and Adversarial Search 2/6/2007 Srini Narayanan ICSI and UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell or

More information

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence Adversarial Search CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far we have only been concerned with a single agent Today, we introduce an adversary! 2 Outline Games Minimax search

More information

Presentation Notes. Frozen suits

Presentation Notes. Frozen suits Presentation Notes The major theme of this presentation was to recognize a dummy where a passive defense is called for. If dummy has no long suits and no ruffing potential, then defenders do best if declarer

More information

Adversarial Search 1

Adversarial Search 1 Adversarial Search 1 Adversarial Search The ghosts trying to make pacman loose Can not come up with a giant program that plans to the end, because of the ghosts and their actions Goal: Eat lots of dots

More information

0.1 Tournament Software

0.1 Tournament Software Peter Teuben - draft 3-mar-2005 0.1 Tournament Software makelist Player records come into email (send by a web page when the player registers) as a database with signups for the various events, and their

More information

gage 2000 FLEXIBLE MEASURING SYSTEM shaping the future of measurement

gage 2000 FLEXIBLE MEASURING SYSTEM shaping the future of measurement gage 2000 THE ULTIMATE FLEIBLE MEASURING SSTEM shaping the future of measurement GAGE 2000 R WILL CHANGE THE WA OU MEASURE All-aluminum construction improves thermal, dimensional/torsional, and geometric

More information

High Speed Communication Circuits and Systems Lecture 10 Mixers

High Speed Communication Circuits and Systems Lecture 10 Mixers High Speed Communication Circuits and Systems Lecture Mixers Michael H. Perrott March 5, 24 Copyright 24 by Michael H. Perrott All rights reserved. Mixer Design or Wireless Systems From Antenna and Bandpass

More information

Control chain diagrams

Control chain diagrams Control chain diagrams 565 Control chain diagrams What this chapter contains The chapter presents the reference chains of the drive. The control chain diagrams can be used to trace how parameters interact

More information

Wireless Channel Modeling (Modeling, Simulation, and Mitigation)

Wireless Channel Modeling (Modeling, Simulation, and Mitigation) Wireless Channel Modeling (Modeling, Simulation, and Mitigation) Dr. Syed Junaid Nawaz Assistant Proessor Department o Electrical Engineering COMSATS Institute o Inormation Technology Islamabad, Paistan.

More information

How to carbon date digital information! Jeremy Clark

How to carbon date digital information! Jeremy Clark How to carbon date digital information! Jeremy Clark Time Mar 2012 2 Notify Vendors Time Mar 2012 3 Notify Vendors Time Mar 2012 Mar 2013 4 Time Mar 2012 Mar 2013 5 Time Mar 2012 Feb 2013 Mar 2013 6 Time

More information

Lecture 2. 1 Nondeterministic Communication Complexity

Lecture 2. 1 Nondeterministic Communication Complexity Communication Complexity 16:198:671 1/26/10 Lecture 2 Lecturer: Troy Lee Scribe: Luke Friedman 1 Nondeterministic Communication Complexity 1.1 Review D(f): The minimum over all deterministic protocols

More information

Global Design Analysis for Highly Repeatable Solid-state Klystron Modulators

Global Design Analysis for Highly Repeatable Solid-state Klystron Modulators CERN-ACC-2-8 Davide.Aguglia@cern.ch Global Design Analysis or Highly Repeatable Solid-state Klystron Modulators Anthony Dal Gobbo and Davide Aguglia, Member, IEEE CERN, Geneva, Switzerland Keywords: Power

More information

CSIsnoop: Attacker Inference of Channel State Information in Multi-User WLANs

CSIsnoop: Attacker Inference of Channel State Information in Multi-User WLANs CSIsnoop: Attacker Inference of Channel State Information in Multi-User WLANs Xu Zhang and Edward W. Knightly ECE Department, Rice University Channel State Information (CSI) CSI plays a key role in wireless

More information

Wireless Network Security Spring 2011

Wireless Network Security Spring 2011 Wireless Network Security 14-814 Spring 2011 Patrick Tague Mar 22, 2011 Class #19 Cross-layer attacks and defenses Announcements Homework #3 is due March 24 Exam in class March 31 Agenda Cross-layer attacks

More information

2/5/17 ADVERSARIAL SEARCH. Today. Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning Real-time decision making

2/5/17 ADVERSARIAL SEARCH. Today. Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning Real-time decision making ADVERSARIAL SEARCH Today Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning Real-time decision making 1 Adversarial Games People like games! Games are fun, engaging, and hard-to-solve

More information

Adversarial Search and Game Playing. Russell and Norvig: Chapter 5

Adversarial Search and Game Playing. Russell and Norvig: Chapter 5 Adversarial Search and Game Playing Russell and Norvig: Chapter 5 Typical case 2-person game Players alternate moves Zero-sum: one player s loss is the other s gain Perfect information: both players have

More information

Testing of Chips Used for Artificial Intelligence. PH Chen, Project Management KeyStone Alan Liao, Product Marketing FormFactor

Testing of Chips Used for Artificial Intelligence. PH Chen, Project Management KeyStone Alan Liao, Product Marketing FormFactor Testing of Chips Used for Artificial Intelligence PH Chen, Project Management KeyStone Alan Liao, Product Marketing FormFactor Agenda Artificial Intelligence Evolution and Market Space Why AI Today AI

More information

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical

More information

Drum Leveler. User Manual. Drum Leveler v Sound Radix Ltd. All Rights Reserved

Drum Leveler. User Manual. Drum Leveler v Sound Radix Ltd. All Rights Reserved 1 Drum Leveler User Manual 2 Overview Drum Leveler is a new beat detection-based downward and upward compressor/expander. By selectively applying gain to single drum beats, Drum Leveler easily achieves

More information

Lecture 8: Media Access Control

Lecture 8: Media Access Control Lecture 8: Media Access Control CSE 123: Computer Networks Alex C. Snoeren HW 2 due NEXT WEDNESDAY Overview Methods to share physical media: multiple access Fixed partitioning Random access Channelizing

More information

COMPSCI 223: Computational Microeconomics - Practice Final

COMPSCI 223: Computational Microeconomics - Practice Final COMPSCI 223: Computational Microeconomics - Practice Final 1 Problem 1: True or False (24 points). Label each of the following statements as true or false. You are not required to give any explanation.

More information

RLC Circuits. Centre College. Physics 230 Lab 8

RLC Circuits. Centre College. Physics 230 Lab 8 ircuits entre ollege Phsics 230 ab 8 1 Preliminaries Objective To stud the electrical characteristics of an alternating current circuit containing a resistor, inductor, and capacitor. Equipment Oscilloscope,

More information

Ar#ficial)Intelligence!!

Ar#ficial)Intelligence!! Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic So far we assumed a single-agent environment, but what if there are more agents and

More information

The detector read-out in ALICE during Run 3 and 4

The detector read-out in ALICE during Run 3 and 4 The detector read-out in ALICE during Run 3 and 4 CHEP 2016 Conference, San Francisco, October 8-14, 2016 Filippo Costa ALICE O2/CRU for the ALICE collaboration OUTLINE 1 st PART: INTRODUCTION TO ALICE

More information

APPLICATION NOTE #1. Phase NoiseTheory and Measurement 1 INTRODUCTION

APPLICATION NOTE #1. Phase NoiseTheory and Measurement 1 INTRODUCTION Tommorrow s Phase Noise Testing Today 35 South Service Road Plainview, NY 803 TEL: 56-694-6700 FAX: 56-694-677 APPLICATION NOTE # Phase NoiseTheory and Measurement INTRODUCTION Today, noise measurements

More information

CS 188: Artificial Intelligence

CS 188: Artificial Intelligence CS 188: Artificial Intelligence Adversarial Search Instructor: Stuart Russell University of California, Berkeley Game Playing State-of-the-Art Checkers: 1950: First computer player. 1959: Samuel s self-taught

More information

BIO Helmet EEL 4914 Senior Design I Group # 3 Frank Alexin Nicholas Dijkhoffz Adam Hollifield Mark Le

BIO Helmet EEL 4914 Senior Design I Group # 3 Frank Alexin Nicholas Dijkhoffz Adam Hollifield Mark Le BIO Helmet EEL 4914 Senior Design I Group # 3 Frank Alexin Nicholas Dijkhoffz Adam Hollifield Mark Le Project Description and Motivation The goal of this project is to create and integrate a system that

More information

Games of Skill Lesson 1 of 9, work in pairs

Games of Skill Lesson 1 of 9, work in pairs Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the

More information

Sequence-based Rendezvous for Dynamic Spectrum Access

Sequence-based Rendezvous for Dynamic Spectrum Access Sequence-based endezvous or Dynamic Spectrum Access Luiz A. DaSilva Bradley Dept. o Electrical and Computer Engineering Virginia Tech Arlington, VA, USA ldasilva@vt.edu Igor Guerreiro Wireless Telecommunications

More information

ECE5984 Orthogonal Frequency Division Multiplexing and Related Technologies Fall Mohamed Essam Khedr. Channel Estimation

ECE5984 Orthogonal Frequency Division Multiplexing and Related Technologies Fall Mohamed Essam Khedr. Channel Estimation ECE5984 Orthogonal Frequency Division Multiplexing and Related Technologies Fall 2007 Mohamed Essam Khedr Channel Estimation Matlab Assignment # Thursday 4 October 2007 Develop an OFDM system with the

More information

CS188 Spring 2010 Section 3: Game Trees

CS188 Spring 2010 Section 3: Game Trees CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.

More information

Resource Allocation in Energy-constrained Cooperative Wireless Networks

Resource Allocation in Energy-constrained Cooperative Wireless Networks Resource Allocation in Energy-constrained Cooperative Wireless Networks Lin Dai City University of Hong ong Jun. 4, 2011 1 Outline Resource Allocation in Wireless Networks Tradeoff between Fairness and

More information

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence Adversarial Search CS 486/686: Introduction to Artificial Intelligence 1 AccessAbility Services Volunteer Notetaker Required Interested? Complete an online application using your WATIAM: https://york.accessiblelearning.com/uwaterloo/

More information

QDI Fine-Grain Pipeline Templates

QDI Fine-Grain Pipeline Templates QDI Fine-Grain Pipeline Templates Peter. eerel University of Southern alifornia Outline synchronous Latches Fine Grain Pipelining Weak ondition Half uffer Template uffer Logic Examples Precharge Full uffer

More information

More on games (Ch )

More on games (Ch ) More on games (Ch. 5.4-5.6) Announcements Midterm next Tuesday: covers weeks 1-4 (Chapters 1-4) Take the full class period Open book/notes (can use ebook) ^^ No programing/code, internet searches or friends

More information

Announcements. Focus! Thin Lens Models. New Topic. Intensity Image Formation. Bi-directional: two focal points! Thin Lens Model

Announcements. Focus! Thin Lens Models. New Topic. Intensity Image Formation. Bi-directional: two focal points! Thin Lens Model Focus! Models Lecture #17 Tuesda, November 1 st, 2011 Announcements Programming Assignment #3 Is due a week rom Tuesda Midterm #2: two weeks rom Tuesda GTA survers: https://www.survemonke.com/r/shpj7j3

More information

Project = An Adventure : Wireless Networks. Lecture 4: More Physical Layer. What is an Antenna? Outline. Page 1

Project = An Adventure : Wireless Networks. Lecture 4: More Physical Layer. What is an Antenna? Outline. Page 1 Project = An Adventure 18-759: Wireless Networks Checkpoint 2 Checkpoint 1 Lecture 4: More Physical Layer You are here Done! Peter Steenkiste Departments of Computer Science and Electrical and Computer

More information

DSP APPLICATION TO THE PORTABLE VIBRATION EXCITER

DSP APPLICATION TO THE PORTABLE VIBRATION EXCITER DSP PPLICTION TO THE PORTBLE VIBRTION EXCITER W. Barwicz 1, P. Panas 1 and. Podgórski 2 1 Svantek Ltd., 01-410 Warsaw, Poland Institute o Radioelectronics, Faculty o Electronics and Inormation Technology

More information

Power and Bandwidth Allocation in Cooperative Dirty Paper Coding

Power and Bandwidth Allocation in Cooperative Dirty Paper Coding Power and Bandwidth Allocation in Cooperative Dirty Paper Coding Chris T. K. Ng 1, Nihar Jindal 2 Andrea J. Goldsmith 3, Urbashi Mitra 4 1 Stanford University/MIT, 2 Univeristy of Minnesota 3 Stanford

More information

Contents H3CR. DIN 48 x 48-mm Multifunctional Timer Series. Broad Line-up of H3CR Series H3CR-A. Solid-state Timer. Common to ALL Timers

Contents H3CR. DIN 48 x 48-mm Multifunctional Timer Series. Broad Line-up of H3CR Series H3CR-A. Solid-state Timer. Common to ALL Timers Solid-state Timer H3CR DIN 48 x 48-mm Multifunctional Timer Series Conforms to EN61812-1 and EN60664-1 (VDE0110) 4 kv/2 for Low Voltage, and EMC Directives. Approved by UL and CSA. Lloyds/NK approvals.

More information

More Adversarial Search

More Adversarial Search More Adversarial Search CS151 David Kauchak Fall 2010 http://xkcd.com/761/ Some material borrowed from : Sara Owsley Sood and others Admin Written 2 posted Machine requirements for mancala Most of the

More information

Prof. Paolo Colantonio a.a

Prof. Paolo Colantonio a.a Pro. Paolo Colantonio a.a. 03 4 Operational ampliiers (op amps) are among the most widely used building blocks in electronics they are integrated circuits (ICs) oten DIL (or DIP) or SMT (or SMD) DIL (or

More information

Three-Prisoners Puzzle. The rest of the course. The Monty Hall Puzzle. The Second-Ace Puzzle

Three-Prisoners Puzzle. The rest of the course. The Monty Hall Puzzle. The Second-Ace Puzzle The rest of the course Three-Prisoners Puzzle Subtleties involved with maximizing expected utility: Finding the right state space: The wrong state space leads to intuitively incorrect answers when conditioning

More information

[3] MOUNTING DIRECTION

[3] MOUNTING DIRECTION Bargraph Indicators N Series BARGRAPH INDICATOR Functions & Features Displays two process variables in dual graphic bargraphs of LED segments Single and dual bargraphs IP front cover plate is easily replaced

More information

Potentiostat stability mystery explained

Potentiostat stability mystery explained Application Note #4 Potentiostat stability mystery explained I- Introduction As the vast majority o research instruments, potentiostats are seldom used in trivial experimental conditions. But potentiostats

More information

High Speed Voltage Feedback Op Amps

High Speed Voltage Feedback Op Amps MT056 TUTORIAL High Speed Voltage Feedback Op Amps In order to intelligently select the correct high speed op amp or a given application, an understanding o the various op amp topologies as well as the

More information

Seeing Music, Hearing Waves

Seeing Music, Hearing Waves Seeing Music, Hearing Waves NAME In this activity, you will calculate the frequencies of two octaves of a chromatic musical scale in standard pitch. Then, you will experiment with different combinations

More information

Introduction to OFDM. Characteristics of OFDM (Orthogonal Frequency Division Multiplexing)

Introduction to OFDM. Characteristics of OFDM (Orthogonal Frequency Division Multiplexing) Introduction to OFDM Characteristics o OFDM (Orthogonal Frequency Division Multiplexing Parallel data transmission with very long symbol duration - Robust under multi-path channels Transormation o a requency-selective

More information

Adversarial Search (Game Playing)

Adversarial Search (Game Playing) Artificial Intelligence Adversarial Search (Game Playing) Chapter 5 Adapted from materials by Tim Finin, Marie desjardins, and Charles R. Dyer Outline Game playing State of the art and resources Framework

More information

SMALL-SIGNAL ANALYSIS AND CONTROL DESIGN OF ISOLATED POWER SUPPLIES WITH OPTOCOUPLER FEEDBACK

SMALL-SIGNAL ANALYSIS AND CONTROL DESIGN OF ISOLATED POWER SUPPLIES WITH OPTOCOUPLER FEEDBACK SMALL-SINAL ANALYSIS AND ONTROL DESIN OF ISOLATED POWER SUPPLIES WITH OPTOOUPLER FEEDAK Yuri Panov and Milan Jovanović Power Electronics Laboratory Delta Products orporation P.O. ox 273, 5 Davis Drive

More information

1 Introduction. 1.1 Game play. CSC 261 Lab 4: Adversarial Search Fall Assigned: Tuesday 24 September 2013

1 Introduction. 1.1 Game play. CSC 261 Lab 4: Adversarial Search Fall Assigned: Tuesday 24 September 2013 CSC 261 Lab 4: Adversarial Search Fall 2013 Assigned: Tuesday 24 September 2013 Due: Monday 30 September 2011, 11:59 p.m. Objectives: Understand adversarial search implementations Explore performance implications

More information

The Art of the Discard

The Art of the Discard The Art of the Discard How do you feel when declarer starts running a long suit? Do you find it hard to breathe? Do you panic? Or do you confidently discard knowing exactly which cards to save? Discard

More information

( ) D. An information signal x( t) = 5cos( 1000πt) LSSB modulates a carrier with amplitude A c

( ) D. An information signal x( t) = 5cos( 1000πt) LSSB modulates a carrier with amplitude A c An inormation signal x( t) 5cos( 1000πt) LSSB modulates a carrier with amplitude A c 1. This signal is transmitted through a channel with 30 db loss. It is demodulated using a synchronous demodulator.

More information

Adversary Search. Ref: Chapter 5

Adversary Search. Ref: Chapter 5 Adversary Search Ref: Chapter 5 1 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans is possible. Many games can be modeled very easily, although

More information

Defending Suit Contracts

Defending Suit Contracts A 6 2 A K J 6 5 4 7 4 3 2 J 9 10 8 7 3 9 2 10 7 A Q 8 6 5 2 9 Q 10 4 A J 9 6 5 3 K Q 5 4 Q 8 3 K J 10 K 8 7 J 9 10 9 A Q 8 6 5 Q 10 4 3 K Q 5 4 A 6 2 Q 8 3 A K 7 6 5 4 K J 10 7 4 3 K 8 7 2 10 8 7 3 J 2

More information

Game Playing: Adversarial Search. Chapter 5

Game Playing: Adversarial Search. Chapter 5 Game Playing: Adversarial Search Chapter 5 Outline Games Perfect play minimax search α β pruning Resource limits and approximate evaluation Games of chance Games of imperfect information Games vs. Search

More information

Mastering the game of Omok

Mastering the game of Omok Mastering the game of Omok 6.S198 Deep Learning Practicum 1 Name: Jisoo Min 2 3 Instructors: Professor Hal Abelson, Natalie Lao 4 TA Mentor: Martin Schneider 5 Industry Mentor: Stan Bileschi 1 jisoomin@mit.edu

More information