Protocoles de vote end-to-end
|
|
- Lee Shaw
- 5 years ago
- Views:
Transcription
1 Protocoles de vote end-to-end Analyse de sécurité basée sur la simulation Olivier de Marneffe, Olivier Pereira, Jean-Jacques Quisquater Université catholique de Louvain, Belgium 19 mars 2008 Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
2 Voting systems What do we expect from a voting system? a tool to reflect the opinion of the voters accuracy vote secrecy... and?? Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
3 Voting systems image source: Ben Adida s PhD Thesis Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
4 Voting systems image source: Ben Adida s PhD Thesis Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
5 End-to-end verifiable voting systems image source: Ben Adida s PhD Thesis Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
6 Formal security analysis of voting systems A need for security analysis of voting protocols to prove the system does what we want to help us structure our approach of the system Definitions of security properties are needed, but: hard to formalize often conceived in different ways difficult to handle Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
7 Simulation-based approach: the big picture Real World Real protocol P Adversary A P A Ideal World Ideal functionality F Simulator S S Adversary A F vote A Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
8 Secure emulation definition A protocol emulates the functionality if S using this ideal functionality: A, A can not distinguish btw interacting: with the real protocol with this S and the ideal functionality Since the ideal functionality is safe, S does no harm when playing with it A does not learn anything unexpected... Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
9 A pedagogic example: ThreeBallot voting system [Fr ].{Ballot de Paille} = [En].{Straw Bundle} UCL Crypto Group Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
10 A pedagogic example: ThreeBallot voting system BALLOT BALLOT BALLOT Alice Alice Bob Bob Carol Carol David David Ed Ed Alice Bob Carol David Ed Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
11 A pedagogic example: ThreeBallot voting system BALLOT BALLOT BALLOT Alice Alice Bob Bob Carol Carol David David Ed Ed Alice Bob Carol David Ed Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
12 A pedagogic example: ThreeBallot voting system BALLOT Alice Bob Carol David Ed Receipt is a copy of one part of the ballot Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
13 A pedagogic example: ThreeBallot voting system Ballots are shuffled and published on a Public Bulletin Board (PBB) Voter can check her receipt is on the PBB Final tally can be done by anyone: count the number of bullets each candidate got subtract the number of voters No crypto at all... Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
14 Simulation-based security approach Definition of what we want the protocol to do definition of a functionality in an ideal world V i (U i, x i ) f (x 1,..., x n )/FAIL F vote π S π reveals what information can be leaked Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
15 Modeling the ThreeBallot protocol REAL WORLD r i U i,multi-ballot i, j x i req i V i r i check complain f (x 1,..., x n )/ FAIL U i BB PS BB A check PBB Auth Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
16 Simulatability of ThreeBallot Simulation can be achieved if: we can build a S such that A sees no difference between being in the Real World the Ideal World reqi U i U i req i U i BB A f (x 1,..., x n ) r F i v S A BB BB OK/FAIL BB ri Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
17 ThreeBallot system: receipts distribution Consider two candidates: Multi-ballots for Alice ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ Multi-ballots for Bob ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ ˆ Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
18 Receipts distribution and election outcome Receipts r = [ ] r = [ ] r = [ ] r = [ ] 100% Alice 2/9 4/9 1/9 2/9 Tie 2/9 5/18 5/18 2/9 100% Bob 2/9 1/9 4/9 2/9 Prop. p for Alice p p 9 3 Distribution of receipts in the real world Simulation is not possible... :-( 2 9 Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
19 Modifying the ThreeBallot protocol (1/3) Simple idea: No information about the vote is on the receipt Select the receipt before you fill in your vote In practice: 1. Fill one bullet per row 2. Choose your receipt 3. Add one bullet to row(s) of your choice Only on the non-receipt part of the ballot Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
20 Modifying the ThreeBallot protocol (2/3) Receipts r = [ ] Probability 4 9 r = [ ] r = [ ] r = [ ] Distribution of the receipts modified protocol Independent of the outcome simulator can generate receipts Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
21 Modifying the ThreeBallot protocol (3/3) Attacker can modify a ballot on the BB Original ThreeBallot protocol Probability of being caught: 1/3 for any ballot Modified version of the protocol Probability of being caught depends on the ballot Worst case for security is 1/9 How to ensure the voter follows the procedure? (not modifying the receipt part of the ballot) Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
22 Modified protocol emulates F vote S can produce indistinguishable BB S can handle BB modifications Under two assumptions: Short Ballot Assumption is satisfied the number of receipts known by the adversary is small in front of the number of voters Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
23 Conclusion Simulation-based security analysis of voting protocols We defined a template for E2E system ideal functionality ThreeBallot protocol: Define π we like Show TB does NOT emulate this definition Fix the protocol Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
24 Protocoles de vote end-to-end Analyse de sécurité basée sur la simulation Olivier de Marneffe, Olivier Pereira, Jean-Jacques Quisquater Université catholique de Louvain, Belgium 19 mars 2008 Microelectronics Laboratory VETO 08 - CIRM, Luminy 19 mars
A Block Cipher Based Pseudo Random Number Generator Secure against Side-Channel Key Recovery
A Block Cipher Based Pseudo Random Number Generator Secure against Side-Channel Key Recovery Christophe Petit 1, François-Xavier Standaert 1, Olivier Pereira 1, Tal G. Malkin 2, Moti Yung 2 1, Université
More informationFive-Card Secure Computations Using Unequal Division Shuffle
Five-Card Secure Computations Using Unequal Division Shuffle Akihiro Nishimura, Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone Sone-Mizuki Lab., Graduate School of Information Sciences,
More informationMA 110 Homework 1 ANSWERS
MA 110 Homework 1 ANSWERS This homework assignment is to be written out, showing all work, with problems numbered and answers clearly indicated. Put your code number on each page. The assignment is due
More informationD. Plurality-with-Elimination Method
Chapter : The Mathematics of Voting (c) 5 + 4 + 3 + 2 + = 5 (d) 5 20 = 300 (e) 300 69 70 64 48 = 49 25. C wins with 500 5 20 25 = 40 points; the points sum to 4 50 + 3 50 + 2 50 + 50 = 500. 26. E. There
More informationRecommendations for E-Voting System Usability: Lessons from Literature for Interface Design, User Studies and Usability Criteria
Recommendations for E-Voting System Usability: Lessons from Literature for Interface Design, User Studies and Usability Criteria 15-16 Oct. 2012 Evoting PhD Workshop Maina Olembo 1 Usable Security Lab
More informationHow 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 informationIntroduction 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 informationINTERNATIONAL RESEARCH JOURNAL IN ADVANCED ENGINEERING AND TECHNOLOGY (IRJAET)
INTERNATIONAL RESEARCH JOURNAL IN ADVANCED ENGINEERING AND TECHNOLOGY (IRJAET) www.irjaet.com ISSN (PRINT) : 2454-4744 ISSN (ONLINE): 2454-4752 Vol. 1, Issue 4, pp.240-245, November, 2015 IRIS RECOGNITION
More informationHow to Implement a Random Bisection Cut
How to Implement a Random Bisection Cut Itaru Ueda, Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki,and Hideaki Sone Graduate School of Information Sciences, Tohoku University 09 Aramaki-Aza-Aoba, Aoba,
More informationSecure 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 informationGeneric Attacks on Feistel Schemes
Generic Attacks on Feistel Schemes -Extended Version- Jacques Patarin PRiSM, University of Versailles, 45 av. des États-Unis, 78035 Versailles Cedex, France This paper is the extended version of the paper
More informationA Glossary of Voting Terminology
A Glossary of Voting Terminology SecVote 2010, 3 sep 2010 Hugo Jonker - p. 2/27 Structure Terms from actual elections Requirements Attacks Cryptography Determining the winner Some academic systems of renown
More informationNote Computations with a deck of cards
Theoretical Computer Science 259 (2001) 671 678 www.elsevier.com/locate/tcs Note Computations with a deck of cards Anton Stiglic Zero-Knowledge Systems Inc, 888 de Maisonneuve East, 6th Floor, Montreal,
More informationMerkle s Puzzles. c Eli Biham - May 3, Merkle s Puzzles (8)
Merkle s Puzzles See: Merkle, Secrecy, Authentication, and Public Key Systems, UMI Research press, 1982 Merkle, Secure Communications Over Insecure Channels, CACM, Vol. 21, No. 4, pp. 294-299, April 1978
More informationCS 261 Notes: Zerocash
CS 261 Notes: Zerocash Scribe: Lynn Chua September 19, 2018 1 Introduction Zerocash is a cryptocurrency which allows users to pay each other directly, without revealing any information about the parties
More informationGeneric Attacks on Feistel Schemes
Generic Attacks on Feistel Schemes Jacques Patarin 1, 1 CP8 Crypto Lab, SchlumbergerSema, 36-38 rue de la Princesse, BP 45, 78430 Louveciennes Cedex, France PRiSM, University of Versailles, 45 av. des
More informationMA 111 Worksheet Sept. 9 Name:
MA 111 Worksheet Sept. 9 Name: 1. List the four fairness criteria. In your own words, describe what each of these critieria say. Majority Criteria: If a candidate recieves more than half of the first place
More informationChapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
1 Relations This book starts with one of its most abstract topics, so don't let the abstract nature deter you. Relations are quite simple but like virtually all simple mathematical concepts they have their
More informationECO 463. SimultaneousGames
ECO 463 SimultaneousGames Provide brief explanations as well as your answers. 1. Two people could benefit by cooperating on a joint project. Each person can either cooperate at a cost of 2 dollars or fink
More informationPart I. First Notions
Part I First Notions 1 Introduction In their great variety, from contests of global significance such as a championship match or the election of a president down to a coin flip or a show of hands, games
More informationAndré and the Ballot Problem - History and a Generalization
André and the Ballot Problem - History and a Generalization Marc Renault Shippensburg University Abstract We describe the ballot problem, give a well-known proof utilizing the reflection method, and present
More informationSimple And Efficient Shuffling With Provable Correctness and ZK Privacy
Simple And Efficient Shuffling With Provable Correctness and ZK Privacy Kun Peng, Colin Boyd and Ed Dawson Information Security Institute Queensland University of Technology {k.peng, c.boyd, e.dawson}@qut.edu.au
More informationPart 2. Cooperative Game Theory
Part 2 Cooperative Game Theory CHAPTER 3 Coalitional games A coalitional game is a model of interacting decision makers that focuses on the behaviour of groups of players. Each group of players is called
More informationLecture 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 informationWe saw Hamilton at a fantastic old theater. It was restored in the 1980s, and Cher performed there once.
Wordiness and Awkward Language Connections Using redundant or extra words is a common problem in writing. This lesson will help you recognize and fix wordiness and awkward language. Need help? Scan the
More informationCard-Based Protocols for Securely Computing the Conjunction of Multiple Variables
Card-Based Protocols for Securely Computing the Conjunction of Multiple Variables Takaaki Mizuki Tohoku University tm-paper+cardconjweb[atmark]g-mailtohoku-universityjp Abstract Consider a deck of real
More informationAndrei Sabelfeld. Joint work with Per Hallgren and Martin Ochoa
Andrei Sabelfeld Joint work with Per Hallgren and Martin Ochoa Privacy for location based services Explosion of interest to location based services (LBS) locating people, vehicles, vessels, cargo, devices
More informationHow wordsy can you be?
Wordsy is a game of longer words! Over the seven rounds of the game, you are trying to find a single word that scores as many points as possible. Unlike other word games, you don t need all the letters
More informationNot-Too-Silly Stories
Not-Too-Silly Stories by Jens Alfke ~ January 2, 2010 is is a free-form, story-oriented, rules-lite, GM-less roleplaying game. It s a bit like a highly simplified version of Universalis. I designed it
More information2 An n-person MK Proportional Protocol
Proportional and Envy Free Moving Knife Divisions 1 Introduction Whenever we say something like Alice has a piece worth 1/2 we mean worth 1/2 TO HER. Lets say we want Alice, Bob, Carol, to split a cake
More informationDistributed 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 informationDevice Pairing at the Touch of an Electrode
Device Pairing at the Touch of an Electrode Marc Roeschlin, Ivan Martinovic, Kasper B. Rasmussen NDSS, 19 February 2018 NDSS 2018 (slide 1) Device Pairing (I) Bootstrap secure communication Two un-associated
More informationEasy English. How to Vote by Mail
Easy English How to use this guide This information is written in an easy to read way. We use pictures to explain some ideas. Some words are written in colour. We explain what these words mean on page
More informationPROBLEM SET Explain the difference between mutual knowledge and common knowledge.
PROBLEM SET 1 1. Define Pareto Optimality. 2. Explain the difference between mutual knowledge and common knowledge. 3. Define strategy. Why is it possible for a player in a sequential game to have more
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Theorem. Let m and n be two relatively prime positive integers. Let a and b be any two integers. Then the two congruences x a (mod m) x b (mod n) have common solutions. Any
More informationOverview GAME THEORY. Basic notions
Overview GAME EORY Game theory explicitly considers interactions between individuals hus it seems like a suitable framework for studying agent interactions his lecture provides an introduction to some
More informationStoa Administrative Calendar
January o Select next year's NITOC TD to shadow this year's TD at NITOC (or earlier -Ideally this would happen ahead of time, so that the process would begin whenever the current TD begins working on the
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
More informationAnalyzing Execution Time of Card-Based Protocols
Analyzing Execution Time of Card-Based Protocols Daiki Miyahara 1, Itaru Ueda 1, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone 1 Graduate School of Information Sciences, Tohoku University 6 09 Aramaki-Aza-Aoba,
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Theorem. Let n 1,..., n r be r positive integers relatively prime in pairs. (That is, gcd(n i, n j ) = 1 whenever 1 i < j r.) Let a 1,..., a r be any r integers. Then the
More informationGetting Around Voting Problems. No or limited accessible parking at the polling place...
No or limited accessible parking at the polling place... What are the possible supports or action steps you can think of? #1 Solutions: Ask if other street parking is available. Carpool or find out busy
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationEncryption at the Speed of Light? Towards a cryptanalysis of an optical CDMA encryption scheme
Encryption at the Speed of Light? Towards a cryptanalysis of an optical CDMA encryption scheme Sharon Goldberg * Ron Menendez **, Paul R. Prucnal * *, ** Telcordia Technologies IPAM Workshop on Special
More informationKnights, Spies, Games and Social Networks
Knights, Spies, Games and Social Networks Mark Wildon 16 February 2010 The Knights and Spies Problem In a room there are 100 people. Each person is either a knight or a spy. Knights always tell the truth,
More informationBasic Probability Concepts
6.1 Basic Probability Concepts How likely is rain tomorrow? What are the chances that you will pass your driving test on the first attempt? What are the odds that the flight will be on time when you go
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
More informationIMPROVED CURRENT MIRROR OUTPUT PERFORMANCE BY USING GRADED-CHANNEL SOI NMOSFETS
IMPROVED CURRENT MIRROR OUTPUT PERFORMANCE BY USING GRADED-CHANNEL SOI NMOSFETS Marcelo Antonio Pavanello *, João Antonio Martino and Denis Flandre 1 Laboratório de Sistemas Integráveis Escola Politécnica
More informationarxiv: v1 [cs.cr] 3 Jun 2016
arxiv:1606.01045v1 [cs.cr] 3 Jun 2016 Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen Xavier Bultel Jannik Dreier Jean-Guillaume Dumas Pascal Lafourcade June 6, 2016 Abstract Akari,
More informationCS1800: More Counting. Professor Kevin Gold
CS1800: More Counting Professor Kevin Gold Today Dealing with illegal values Avoiding overcounting Balls-in-bins, or, allocating resources Review problems Dealing with Illegal Values Password systems often
More informationBuilding Oblivious Transfer on Channel Delays
Building Oblivious Transfer on Channel Delays Paolo Palmieri and Olivier Pereira Université catholique de Louvain UCL Crypto Group Place du Levant 3, B-1348 Louvain-la-Neuve, Belgium {paolo.palmieri,olivier.pereira}@uclouvain.be
More informationDigital support for gathering administrative ideas from constituents of democratic bodies
Digital support for gathering administrative ideas from constituents of democratic bodies Marius C. Silaghi and Ronald J. Bailey and Phil Bernhard and Phil K. Chan and Cem Kaner February 17, 2004 Florida
More informationDeterring Voluntary Trace Disclosure in Re-encryption Mix Networks
Deterring Voluntary Trace Disclosure in Re-encryption Mix Networks Philippe Golle PARC pgolle@parc.com XiaoFeng Wang Indiana University xw7@indiana.edu Markus Jakobsson Indiana University markus@indiana.edu
More information*A version of the game Secret Hitler made for Homestuck. Enjoy!
CAN YOU FIND AND STOP THE... *A version of the game Secret Hitler made for Homestuck. Enjoy! Welcome to the Medium: a separate universe accessed by the video game called Sburb. In this mutant session,
More informationThe year is 298 After Aegon's Conquest. The place is King's Landing, the capital of Westeros. King Robert has just died in a hunting accident.
The year is 298 After Aegon's Conquest. The place is King's Landing, the capital of Westeros. King Robert has just died in a hunting accident. The Lannisters are running the country from the Royal Court
More informationData Dependent Power Use in Multipliers
Data Dependent Power Use in Multipliers Colin D. Walter Comodo Research Laboratory, 7 Campus Road, Bradford, BD7 1HR, UK e-mail: Colin.Walter@comodo.com David Samyde Λ FemtoNano, Paris e-mail: David.Samyde@FemtoNano.com
More informationMATH4994 Capstone Projects in Mathematics and Economics
MATH4994 Capstone Projects in Mathematics and Economics Homework One Course instructor: Prof. Y.K. Kwok 1. This problem is related to the design of the rules of a game among 6 students for allocating 6
More informationThe sensible guide to y
The sensible guide to 802.11y On September 26th, IEEE 802.11y-2008, an amendment to the IEEE 802.11-2007 standard, was approved for publication. 3650 Mhz The 802.11y project was initiated in response to
More informationUnlinkability and Redundancy in Anonymous Publication Systems
Unlinkability and Redundancy in Anonymous Publication Systems Christian Boesgaard pink@diku.dk Department of Computer Science University of Copenhagen Denmark January 22, 2004 1 Introduction An anonymous
More informationPhysical Zero-Knowledge Proof: From Sudoku to Nonogram
Physical Zero-Knowledge Proof: From Sudoku to Nonogram Wing-Kai Hon (a joint work with YF Chien) 2008/12/30 Lab of Algorithm and Data Structure Design (LOADS) 1 Outline Zero-Knowledge Proof (ZKP) 1. Cave
More informationthan six players on one side of the table and a place for the dealer on the opposite The layout for a Dragon Poker table shall contain, at a minimum:
CHAPTER 69E GAMING EQUIPMENT 13:69E-1.13BB Dragon Poker table; physical characteristics Dragon Poker shall be played on a table having positions for no more than six players on one side of the table and
More informationBut Wait, There s More! By Jay Cormier and Sen-Foong Lim
But Wait, There s Rules! A game for 3 or more players where the perfect pitch will win the prize! Components 90 x Item Cards (pages 1-5. Tip: print on different coloured paper than the Benefit Cards) 108
More informationAndrés Sánchez González. FTEC 2nd Workshop. CERN and CIEMAT. CERN Graphic Charter: use of the outline version of the CERN logo.
Design, production and test of readout electronics for the assessment of the radiation hardness of pixel sensor based detector components for the ALICE ITS Upgrade project Andrés Sánchez González CERN
More informationPARADOXES WITH DICE AND ELECTIONS
PARADOXES WITH DICE AND ELECTIONS Marcel Jackson La Trobe University Some startling paradoxes can be found with games involving relabeled dice. We look at some of the possibilities and their connection
More informationGAME THEORY Day 5. Section 7.4
GAME THEORY Day 5 Section 7.4 Grab one penny. I will walk around and check your HW. Warm Up A school categorizes its students as distinguished, accomplished, proficient, and developing. Data show that
More information(ii) Methodologies employed for evaluating the inventive step
1. Inventive Step (i) The definition of a person skilled in the art A person skilled in the art to which the invention pertains (referred to as a person skilled in the art ) refers to a hypothetical person
More informationMohammad Hossein Manshaei 1394
Mohammad Hossein Manshaei manshaei@gmail.com 394 Some Formal Definitions . First Mover or Second Mover?. Zermelo Theorem 3. Perfect Information/Pure Strategy 4. Imperfect Information/Information Set 5.
More informationThe number theory behind cryptography
The University of Vermont May 16, 2017 What is cryptography? Cryptography is the practice and study of techniques for secure communication in the presence of adverse third parties. What is cryptography?
More informationUnconditionally secure quantum key distribution over 50km of satndard telecom fibre
Unconditionally secure quantum key distribution over 50km of satndard telecom fibre C. Gobby,* Z. L. Yuan and A. J. Shields Toshiba Research Europe Ltd, Cambridge Research Laboratory, 260 Cambridge Science
More informationMicroeconomics of Banking: Lecture 4
Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later
More informationNarrow misère Dots-and-Boxes
Games of No Chance 4 MSRI Publications Volume 63, 05 Narrow misère Dots-and-Boxes SÉBASTIEN COLLETTE, ERIK D. DEMAINE, MARTIN L. DEMAINE AND STEFAN LANGERMAN We study misère Dots-and-Boxes, where the goal
More informationHow to Implement a Random Bisection Cut
How to Implement a Random Bisection Cut Itaru UEDA 1 Akihiro NISHIMURA 1 Yu ichi HAYASHI 2 Takaaki MIZUKI 1 Hideaki SONE 1 1 Tohoku University 2 Tohoku Gakuin University TPNC 2016 Introduction What is
More informationA Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems
A Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems Philipp Locher 1,2 and Rolf Haenni 1 1 Research Institute for Security in the Information Society Bern University of Applied
More informationDr. Eng. Nabila Bounceur PhD. in Science - Engineer in Automatic
Dr. Eng. Nabila Bounceur PhD. in Science - Engineer in Automatic Objectives New challenges in analyzing and modeling of complex systems, design of computer experiments and data analysis, teaching and training
More informationEXPLICIT AND NORMAL FORM GAMES
1 EXPLICIT AND NORMAL FORM GAMES 2 EXPLICIT FORM GAMES Example. Game of Nim Consider a simple game where two players let us denote them 1, 2 have two piles at the table in front of them, each consisting
More informationSR&ED for the Software Sector Northwestern Ontario Innovation Centre
SR&ED for the Software Sector Northwestern Ontario Innovation Centre Quantifying and qualifying R&D for a tax credit submission Justin Frape, Senior Manager BDO Canada LLP January 16 th, 2013 AGENDA Today
More informationMedians of permutations and gene orders
Medians of permutations and gene orders Sylvie Hamel Université de Montréal Work in collaboration with: Guillaume Blin Maxime Crochemore Stéphane Vialette from Université Marne-la-Vallée Medians of permutations
More informationMASTER THESIS PROJECT PROPOSALS: SIGNAL PROCESSING FOR WIRELESS AND SATELLITE COMMUNICATIONS
MASTER THESIS PROJECT PROPOSALS: SIGNAL PROCESSING FOR WIRELESS AND SATELLITE COMMUNICATIONS Prof. Claudio Sacchi Academic year 2017-2018 General rules The listed thesis projects are specifically available
More informationCh. 653a ULTIMATE TEXAS HOLD EM POKER a.1. CHAPTER 653a. ULTIMATE TEXAS HOLD EM POKER
Ch. 653a ULTIMATE TEXAS HOLD EM POKER 58 653a.1 CHAPTER 653a. ULTIMATE TEXAS HOLD EM POKER Sec. 653a.1. 653a.2. 653a.3. 653a.4. 653a.5. 653a.6. 653a.7. 653a.8. 653a.9. 653a.10. 653a.11. 653a.12. 653a.13.
More informationLecture 11 Strategic Form Games
Lecture 11 Strategic Form Games Jitesh H. Panchal ME 597: Decision Making for Engineering Systems Design Design Engineering Lab @ Purdue (DELP) School of Mechanical Engineering Purdue University, West
More informationCSE 573 Problem Set 1. Answers on 10/17/08
CSE 573 Problem Set. Answers on 0/7/08 Please work on this problem set individually. (Subsequent problem sets may allow group discussion. If any problem doesn t contain enough information for you to answer
More informationInternet 0: Past, Present, and Future October 1, 2004 SPEAKER BIOGRAPHIES
Internet 0: Past, Present, and Future October 1, 2004 SPEAKER BIOGRAPHIES Bob Briscoe Bob Briscoe joined BT in 1980 and now directs the research programme of BT's Networks Research Centre. In the late-1980s
More informationJINX - 2 Players / 15 Minutes
JINX - 2 Players / 15 Minutes Players are witches who combine secret ingredients to make big and powerful potions. Each witch will contribute one of the ingredients needed to make a potion. If they can
More informationIntroduction to Cryptography
B504 / I538: Introduction to Cryptography Spring 2017 Lecture 11 * modulo the 1-week extension on problems 3 & 4 Assignment 2 * is due! Assignment 3 is out and is due in two weeks! 1 Secrecy vs. integrity
More information(e) Each 3 Card Blitz table shall have a drop box and a tip box attached to it on the same side of the table as, but on opposite sides of the dealer.
CHAPTER 69E GAMING EQUIPMENT 13:69E-1.13BB - 3 Card Blitz table; physical characteristics (a) 3 Card Blitz shall be played on a table having positions for no more than six players on one side of the table
More informationEE 418: Network Security and Cryptography
EE 418: Network Security and Cryptography Homework 3 Solutions Assigned: Wednesday, November 2, 2016, Due: Thursday, November 10, 2016 Instructor: Tamara Bonaci Department of Electrical Engineering University
More informationCryptology and Graph Theory
Cryptology and Graph Theory Jean-Jacques Quisquater jjq@dice.ucl.ac.be November 16, 2005 http://www.uclcrypto.org Mierlo, Netherlands Warning: Audience may be addicted by Powerpoint. Use with moderation.
More informationProfessor Alan H. Stein
Mathematics 103 Professor Alan H. Stein July 7, 2004 Solutions Final Examination (1) Consider an election among four candidates: James, Theresa, Marie and Donnie. Suppose 1850 voters cast ballots on which
More informationGame Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness
Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what
More informationPublic Key Encryption
Math 210 Jerry L. Kazdan Public Key Encryption The essence of this procedure is that as far as we currently know, it is difficult to factor a number that is the product of two primes each having many,
More informationAP Statistics Ch In-Class Practice (Probability)
AP Statistics Ch 14-15 In-Class Practice (Probability) #1a) A batter who had failed to get a hit in seven consecutive times at bat then hits a game-winning home run. When talking to reporters afterward,
More informationNote that there are questions printed on both sides of each page!
Math 1001 Name: Fall 2007 Test 2 Student ID: 11/7/07 Time allowed: 50 minutes Section: 10:10 11:15 12:20 This exam includes 7 pages, including this one and a sheet for scratch work. There are a total of
More information10 GIGABIT ETHERNET CONSORTIUM
10 GIGABIT ETHERNET CONSORTIUM Clause 54 10GBASE-CX4 PMD Test Suite Version 1.0 Technical Document Last Updated: 18 November 2003 10:13 AM 10Gigabit Ethernet Consortium 121 Technology Drive, Suite 2 Durham,
More informationElection Notice. Upcoming FINRA Board of Governors Election. April 27, Petitions for Candidacy Due: June 11, 2015.
Election Notice Upcoming FINRA Board of Governors Election Petitions for Candidacy Due: June 11, 2015 April 27, 2015 Suggested Routing Executive Representatives Senior Management Executive Summary The
More information"If You Want A Cheat-Sheet On How To Get Loads Of Traffic From Instagram Then Enter Your Information Below To Download It Right Away!
Squeeze Template 1 - Basic Example: "If You Want A Cheat-Sheet On How To Get Loads Of Traffic From Instagram Then Enter Your Information Below To Download It Right Away!" Fill-in-the-blanks "If You Want
More informationDetailed Solutions of Problems 18 and 21 on the 2017 AMC 10 A (also known as Problems 15 and 19 on the 2017 AMC 12 A)
Detailed Solutions of Problems 18 and 21 on the 2017 AMC 10 A (also known as Problems 15 and 19 on the 2017 AMC 12 A) Henry Wan, Ph.D. We have developed a Solutions Manual that contains detailed solutions
More informationExample 1. An urn contains 100 marbles: 60 blue marbles and 40 red marbles. A marble is drawn from the urn, what is the probability that the marble
Example 1. An urn contains 100 marbles: 60 blue marbles and 40 red marbles. A marble is drawn from the urn, what is the probability that the marble is blue? Assumption: Each marble is just as likely to
More informationBest of luck on the exam!
CS103 Handout 18 Fall 2014 October 20, 2014 Practice Midterm Exam This practice exam is closed-book and closed-computer but open-note. You may have a doublesided, 8.5 11 sheet of notes with you when you
More informationDate. Probability. Chapter
Date Probability Contests, lotteries, and games offer the chance to win just about anything. You can win a cup of coffee. Even better, you can win cars, houses, vacations, or millions of dollars. Games
More informationMajority Rule: Each voter votes for one candidate. The candidate with the majority of the votes wins. Majority means MORE than half.
Math 167 h 9 Week in Review 1 (c) Janice Epstein and Tamara arter HPTER 9 VOTING Majority Rule: Each voter votes for one candidate. The candidate with the majority of the votes wins. Majority means MORE
More informationWireless Network Security Spring 2015
Wireless Network Security Spring 2015 Patrick Tague Class #5 Jamming, Physical Layer Security 2015 Patrick Tague 1 Class #5 Jamming attacks and defenses Secrecy using physical layer properties Authentication
More information