Secure Poker Post PC project 2002. Motivation Games have been pushing computer industry Many people carry gadgets, but hardly a pack of cards. (even during.

Slides:

Advertisements

Similar presentations

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.

Advertisements

Thomas S. Messerges, Ezzat A. Dabbish Motorola Labs Shin Seung Uk.

Cryptography and Game Theory: Designing Protocols for Exchanging Information Gillat Kol and Moni Naor.

Secure Multiparty Computations on Bitcoin

Requirements for a Secure Voting System  Only authorized voters can vote  No one can vote more than once  No one can determine for whom anyone else.

1 SECURE-PARTIAL RECONFIGURATION OF FPGAs MSc.Fisnik KRAJA Computer Engineering Department, Faculty Of Information Technology, Polytechnic University of.

Cheat-Proof Playout for Centralized and Distributed Online Games By Nathaniel Baughman and Brian Levine (danny perry)

Mental Poker The SRA Protocol. What is Mental Poker? Playing poker without cards (ie over telephone or internet). No Trusted Third Party or source of.

Stopping cheaters since By: Tigran Gasparian.

ITIS 6200/ Secure multiparty computation – Alice has x, Bob has y, we want to calculate f(x, y) without disclosing the values – We can only do.

Data Integrity Proofs in Cloud Storage Sravan Kumar R, Ashutosh Saxena Communication Systems and Networks (COMSNETS), 2011 Third International Conference.

Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.

1 Network Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.

Digital Signatures and Hash Functions. Digital Signatures.

Netprog: Cryptgraphy1 Cryptography Reference: Network Security PRIVATE Communication in a PUBLIC World. by Kaufman, Perlman & Speciner.

Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.

Using Cryptographic ICs For Security and Product Management Misconceptions about security Network and system security Key Management The Business of Security.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

Centinel tournament ● A deck: the numbers in random order ● A game lasts until no numbers are left in deck ● A game is played like this (first player.

ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

Pass in HW6 now Can use up to 2 late days Can use up to 2 late days But one incentive not to burn them all: teams will get to pick their presentation day.

ITIS 6200/8200. time-stamping services Difficult to verify the creation date and accurate contents of a digital file Required properties of time-stamping.

CMSC 414 Computer and Network Security Lecture 14 Jonathan Katz.

Chapter 3 Encryption Algorithms & Systems (Part C)

Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.

ELECTRONIC PAYMENT SYSTEMSFALL 2001COPYRIGHT © 2001 MICHAEL I. SHAMOS Electronic Payment Systems Lecture 6 Epayment Security II.

PRESENTED BY CHRIS ANDERSON JULY 29, 2009 Using Zero Knowledge Proofs to Validate Electronic Votes.

VOCABULARY  Deck or pack  Suit  Hearts  Clubs  Diamonds  Spades  Dealer  Shuffle  Pick up  Rank  Draw  Set  Joker  Jack 

X-Road (X-tee) A platform-independent secure standard interface between databases and information systems to connect databases and information systems.

Cryptographic Voting Protocols: A Systems Perspective By Chris Karlof, Naveen Sastry, and David Wagner University of California, Berkely Proceedings of.

OpenConflict: Preventing Real Time Map Hacks in Online Games Elie Bursztein, Mike Hamburg, Jocelyn Lagarenne, Dan Boneh (Stanford University) IEEE Symposium.

Authentication Approaches over Internet Jia Li

Programming Satan’s Computer

How to play ANY mental game

Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.

Protocols to do seemingly impossible 1 CHAPTER 11: Protocols to do seemingly impossible A protocol is an algorithm two (or more) parties have to follow.

Trusted Computing BY: Sam Ranjbari Billy J. Garcia.

An Efficient and Secure Event Signature (EASES) Protocol for Peer-to-Peer Massively Multiplayer Online Games Mo-Che Chan, Shun-Yun Hu and Jehn-Ruey Jiang.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

Chapter 4: Intermediate Protocols

The Cryptographic Sensor FTO Libor Dostálek, Václav Novák.

COEN 351 E-Commerce Security Essentials of Cryptography.

Lecture 10: Mental Poker Wayne Patterson SYCS 654 Spring 2010.

Phosphor A Cloud based DRM Scheme with Sim Card th International Asia-Pacific Web Conference Author : Peng Zou, Chaokun Wang, Zhang Liu, Dalei.

1 Hardware Security AbdelRahman abu_absah Teacher: Dr. Sanaa al_sayegh.

Modern Cryptographic Topics

1 Cryptography NOTES. 2 Secret Key Cryptography Single key used to encrypt and decrypt. Key must be known by both parties. Assuming we live in a hostile.

Chapter 4 Using Encryption in Cryptographic Protocols & Practices (Part B)

Network Security – Special Topic on Skype Security.

Chapter 4 Using Encryption in Cryptographic Protocols & Practices.

Based on Bruce Schneier Chapter 8: Key Management Dulal C Kar.

Flipping coins over the telephone and other games.

Secure Conjunctive Keyword Search Over Encrypted Data Philippe Golle Jessica Staddon Palo Alto Research Center Brent Waters Princeton University.

A A E E D D C C B B # Symmetric Keys = n*(n-1)/2 F F

SSL. Why Is Security Important ●Security is important on E-Commerce because it makes sure that your information gets from your computer to their server.

Security Using PGP - Prajakta Bahekar. Importance of Security is one of the most widely used network service on Computer Currently .

14-1 Last time Internet Application Security and Privacy Basics of cryptography Symmetric-key encryption.

COEN 351 E-Commerce Security

Data Integrity Proofs in Cloud Storage Author: Sravan Kumar R and Ashutosh Saxena. Source: The Third International Conference on Communication Systems.

Anonymous Statistical Survey of Attributes Toru Nakanishi and Yuji Sugiyama Okayama Univ., Japan.

Exploiting Instruction Streams To Prevent Intrusion Milena Milenkovic.

Software Security Seminar - 1 Chapter 4. Intermediate Protocols 발표자 : 이장원 Applied Cryptography.

Card Game Z  Agree on a dealer and a score keeper  The dealer should remove all the Jacks, Queens, Kings & Jokers from the pack and then shuffle  The.

Breaking Cryptosystems Joshua Langford University of Texas at Tyler Fall 2007 Advisor: Dr. Ramona Ranalli Alger.

Bit Commitment, Fair Coin Flips, and One-Way Accumulators Matt Ashoff 11/9/2004 Cryptographic Protocols.

1/18 Talking to Strangers: Authentication in Ad-Hoc Wireless Networks Dirk Balfanz 외 2 명 in Xerox Palo Alto Research Center Presentation: Lee Youn-ho.

Cheaters Gonna Cheat Battling Fake High Scores Nataly Eliyahu CASUAL CONNECT TEL AVIV 19 – 21 OCTOBER 2015.

Presentation transcript:

Secure Poker Post PC project 2002

Motivation Games have been pushing computer industry Many people carry gadgets, but hardly a pack of cards. (even during a hike :-) Why should you trust the opponent’s computer?

Casino without dealer? It will be nice to deal pack of cards without a dealer. So who will deal the pack? –Two packs solution –One pack solution

Pack per player solution Player ‘A’ is to receive a card ‘A’ shuffles his pack, but does not show the shuffled pack to his opponent ‘B’ ‘B’ chooses a random number #i. ‘A’ picks up card #i from the pack. How ‘B’ could prevent ‘A’ from cheating?

Commitment and Verification At the begging of the game ‘A’ sends a commitment to his shuffled pack. At the end of the game ‘A’ sends the shuffled pack to ‘B’. ‘B’ verifies that commitment is correct. Secure hash (one-way function) is used to calculate the commitment.

One pack solution Player A Shuffles pack Encrypts (key1) each card in pack and sends the pack to ‘B’ Decrypts(key1) a random card and sends it to ‘B’ Player B Shuffles encrypted pack and encrypts (key2) the pack and sends it to ‘A’ Decrypts (key2) the card and uses it

Illustration

Real Demonstration

Requirements Network Memory CPU Battery

Other usages of this protocol Casting lots and playing lotteries Games requiring commitment (e.g. scissors, stone and knife or זוג הפרד) e-commerce e-voting

Conclusions Cryptographic solution are not always applicable. May be we need a special hardware, or a trusted dealer, or just a change of the rules? Technology is advancing and games are increasingly available on PDA PDA is going to be secure platform! Development is really doable !