Secure and Practical lottery protocol Sep. 13, 2001 2001140 C&IS lab. Ham Woo Seok ICE 615 Network Security Term project Progressive.

Slides:



Advertisements
Similar presentations
Secure Multiparty Computations on Bitcoin
Advertisements

A Pairing-Based Blind Signature
Cryptography and Network Security
SECURITY IN E-COMMERCE VARNA FREE UNIVERSITY Prof. Teodora Bakardjieva.
Digital Signatures and Hash Functions. Digital Signatures.
Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.
1 Digital Signatures & Authentication Protocols. 2 Digital Signatures have looked at message authentication –but does not address issues of lack of trust.
Slide 1 Vitaly Shmatikov CS 378 Digital Cash. slide 2 Digital Cash: Properties uDigital “payment message” with properties of cash uUnforgeable Users cannot.
Payment Systems 1. Electronic Payment Schemes Schemes for electronic payment are multi-party protocols Payment instrument modeled by electronic coin that.
Secure and Practical lottery protocol using bank as a notary Sep. 13, C&IS lab. Ham Woo Seok ICE 615 Network Security Term.
1 Authentication Applications Digital Signatures Security Concerns X.509 Authentication Service Kerberos Based on slides by Dr. Lawrie Brown of the Australian.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Cryptography and Network Security Chapter 17
Micro-Payment Protocols and Systems Speaker: Jerry Gao Ph.D. San Jose State University URL:
ELECTRONIC PAYMENT SYSTEMSFALL 2001COPYRIGHT © 2001 MICHAEL I. SHAMOS eCommerce Technology Lecture 10 Micropayments I.
Digital Cash Damodar Nagapuram. Overview ► Monetary Freedom ► Digital Cash and its importance ► Achieving Digital Cash ► Disadvantages with digital cash.
1 A practical off-line digital money system with partially blind signatures based on the discrete logarithm problem From: IEICE TRANS. FUNDAMENTALS, VOL.E83-A,No.1.
Anonymity and Security in Public Internet Forums Ho-fung LEUNG Senior Member, IEEE Dept. of Computer Science & Engineering The Chinese University of Hong.
More on AuthenticationCS-4513 D-term More on Authentication CS-4513 Distributed Computing Systems (Slides include materials from Operating System.
Chapter 8 Web Security.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
ELECTRONIC PAYMENT SYSTEMS FALL 2002COPYRIGHT © 2002 MICHAEL I. SHAMOS eCommerce Technology Lecture 9 Micropayments I.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 4 Data Authentication Part II.
Digital Signature Xiaoyan Guo/ Xiaohang Luo/
Peppercorn Micropayments via better “Lottery Tickets” Ron Rivest (with Silvio Micali) MIT Laboratory for Computer Science Financial Cryptography Conference.
8. Data Integrity Techniques
Computer Security Tran, Van Hoai Department of Systems & Networking Faculty of Computer Science & Engineering HCMC University of Technology.
Digital Cash By Gaurav Shetty. Agenda Introduction. Introduction. Working. Working. Desired Properties. Desired Properties. Protocols for Digital Cash.
Cong Wang1, Qian Wang1, Kui Ren1 and Wenjing Lou2
Networks and Security. Types of Attacks/Security Issues  Malware  Viruses  Worms  Trojan Horse  Rootkit  Phishing  Spyware  Denial of Service.
Secure Electronic Transaction (SET)
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
1 Anonymous Roaming Authentication Protocol with ID-based Signatures Lih-Chyau Wuu Chi-Hsiang Hung Department of Electronic Engineering National Yunlin.
IT 221: Introduction to Information Security Principles Lecture 6:Digital Signatures and Authentication Protocols For Educational Purposes Only Revised:
Chapter 4: Intermediate Protocols
SecureMR: A Service Integrity Assurance Framework for MapReduce Author: Wei Wei, Juan Du, Ting Yu, Xiaohui Gu Source: Annual Computer Security Applications.
Securing Electronic Transactions University of Palestine Eng. Wisam Zaqoot April 2010 ITSS 4201 Internet Insurance and Information Hiding.
Digital Cash. p2. OUTLINE  Properties  Scheme  Initialization  Creating a Coin  Spending the Coin  Depositing the Coin  Fraud Control  Anonymity.
Cryptography and Network Security (CS435) Part Fourteen (Web Security)
Web Security : Secure Socket Layer Secure Electronic Transaction.
6. Esoteric Protocols secure elections and multi-party computation Kim Hyoung-Shick.
TM MilliCent Scrip, Security and Secrets TM Dr. Mark S. Manasse DIGITAL Systems Research Center, Palo Alto
Chapter 21 Distributed System Security Copyright © 2008.
Chapter 6:Esoteric Protocols Dulal C Kar. Secure Elections Ideal voting protocol has at least following six properties 1.Only authorized voters can vote.
Round Saving Bulletin-based Tripartite e-Lottery Protocol Dec. 18, C&IS lab. Ham Woo Seok
11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.
Shanti Bramhacharya and Nick McCarty. This paper deals with the vulnerability of RFIDs A Radio Frequency Identifier or RFID is a small device used to.
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Network Security Lecture 27 Presented by: Dr. Munam Ali Shah.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
A new provably secure certificateless short signature scheme Authors: K.Y. Choi, J.H. Park, D.H. Lee Source: Comput. Math. Appl. (IF:1.472) Vol. 61, 2011,
Software Security Seminar - 1 Chapter 4. Intermediate Protocols 발표자 : 이장원 Applied Cryptography.
A Novel Privacy Preserving Authentication and Access Control Scheme for Pervasive Computing Environments Authors: Kui Ren, Wenjing Lou, Kwangjo Kim, and.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Network Security Celia Li Computer Science and Engineering York University.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
TOMIN: Trustworthy Mobile Cash with Expiration-date Attached Author: Rafael Martínez-Peláez and Francisco Rico-Novella. Source: Journal of Software, 2010,
多媒體網路安全實驗室 Private Information Retrieval Scheme Combined with E- Payment in Querying Valuable Information Date: Reporter: Chien-Wen Huang 出處:
Bit Commitment, Fair Coin Flips, and One-Way Accumulators Matt Ashoff 11/9/2004 Cryptographic Protocols.
Electronic Banking & Security Electronic Banking & Security.
Prof. Reuven Aviv, Nov 2013 Public Key Infrastructure1 Prof. Reuven Aviv Tel Hai Academic College Department of Computer Science Public Key Infrastructure.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
Threat Modeling for Cloud Computing
Cryptography and Network Security
By Hyun-Chul Kim, Hong-Woo Lee, Kyung-Seok Lee, Moon-Seog Jun
Cryptography and Network Security
Presentation transcript:

Secure and Practical lottery protocol Sep. 13, C&IS lab. Ham Woo Seok ICE 615 Network Security Term project Progressive Report

by Charlie Ham Lottery -2- Contents 1.Overview 2.Threats 3.Requirement 4.Pervious Work – KMHN00,GS98 5.Proposed scheme 6.Further Works 7.Reference

by Charlie Ham Lottery Overview  Sports TOTO  Nationwide issue of tickets was launched Oct. 6  England (Football Pools,1923), France (Loto Foot), Italia (TotoCalcio, TotoGoal), Japan(TOTO) etc. TargetSoccer (K-league) PublisherSeoul Olympic Sports Promotion Foundation(SOSPF) ConsigneeTigerpools Korea Game typeResult-based (1X2) Rate1,000 won per an unit (maximum 96 units) AvailableUp to 10 minutes before game RestrictionLess then 100,000 won a person Over 19 years old Annual IssueLess than 90 times Prize50% of the amount of sold tickets If no winner, winning pool is rolled over to the next lottery Current operationFill out the ticket  present ticket with money to vender  receive a receipt

by Charlie Ham Lottery Threats  Ticket Information manipulation  Altering, Insertion, Deletion  Promoter’s misbehaviors  Wrong winning computation, No payment of prize, etc  Collusion of lottery components  User, Lottery organizer, Financial facility, Vendor, Audit authorities etc.  Phantom vendors  Receive claims and disappear  Denial of service  Hindrance of normal operation, penalization of server, etc  Disputes  Winner arguments, refund etc

by Charlie Ham Lottery Requirement  Basic requirement  Reduction of Computational complexity & communication data  Security requirement  R1: Privacy Prize-winner’s privacy should be maintained  R2: Fairness Every ticket has the same probability to win  R3: Publicly verifiability Valid winnings could be verified publicly  R4: Reliability Anyone can detect injustice of lottery components  R5: Integrity Lottery ticket cannot tampered  R6: Timeliness A lottery should be terminated in the pre-defined period

by Charlie Ham Lottery Previous Work – KMHN00  K.Kobayashi, H.Morita, M.Hakuta, T.Nakanowatari, IEICE 2000 Bit commitment & Hash function  Soccer lottery protocol Based on Bit commitment & Hash function  Notation  h: hash function  h*: partial information of hash value  TLP: Target Lottery Pattern (=mark sheet)  PID: Personal Identification information  SID: Shop Identification  n: total ticket number sold by a shop  SLI: Concatenation of SID, Lottery number, n)  || : concatenation  Sig: Digital signature  $M: Electronic money

by Charlie Ham Lottery -7-  Lottery Protocol 4. Previous Work – KMHN00 User Promoter Shop SIDh1h2TLP User Shop Soccer Lottery Protocol Payment Protocol (Off-line)

by Charlie Ham Lottery Previous Work – KMHN00  Details  Purchase protocol 1) User computes hash value h1 with the concatenation of hashed PID and TLP –Hashed PID: If original PID used, an malicious insider in bank can impersonate prize winners. Also, PID includes a random number to hide PID itself. –TLP: it is generated by User according to specific rules 2) User sends TLP, h1, and fee (electronic money) for her betting 3) User receives SID as a receipt and Shop transfer TLP, h1, $M and SID as well 4) Promoter yields h2 using SID and h1 and store TLP, h2, h1, SID  Inquiry protocol (To verify her betting information is registered) 5) User calculates h2 –h2: protect information difference between Promotor & Shop 6) User sends TLP and partial value of h2 (=h2*) to Promoter 7) Promoter searches and extracts matching values with TLP & partial hash value from database and send them to User  After closing (To detect the promoter’s injustice to update the database illegally) 8) Promoter notifies Shop the number of lottery tickets which are from the Shop 9) Shop confirms the number, if right, she generates signature with SID, lottery number and n. And Promoter generates digital signature on all TLPs and h2s  Payment protocol (Off-line operation) 1) Winner sends her hash value of PID 2) She visits the Bank(financial facility) and presents her real ID in person 3) If correct, Bank delivers a prize to her

by Charlie Ham Lottery Previous Work – KMHN00  Problems  Prize-payment by off-line In case of small prize, User feel inconvenience  PID can not be secret information Even though using a random number with original PID, assumed that there are a number of winners, we can get more probability of hash collision  Promoter can find possible partial combination of summation of TLP and h2. she can alter some information which does not match to one from shop after closing the period  Collusion of Promoter and Shop might be occurred to get manipulate total lottery number and information

by Charlie Ham Lottery Previous Work – GS98  David M. Goldschlag, Stuart G. Stubblebine, IFCA 98 delaying function  Drawing number type lottery based on delaying function  Delaying function Function F is moderately hard to compute given a minimum operation time P, and probability that function is computable is arbitrarily small F preserves the information of its inputs. No information leakage e.g) large number of rounds of DES in OFB mode  Notation  L, C : Lottery server, Client respectively  : Keyed one way hash function  : Certification of client C  Seq : Sequence number of lottery ticket  Time: Time stamp  Seed: betting information  P : critical purchase period  L : the total number of sold tickets

by Charlie Ham Lottery -11-  Phases  Registration To make A certain collusion which can control lottery impossible, identification is needed Mapping between client and client agent by certification For anonymous, use bind certificate or lottery service own certificate  Purchase Sequence number: to supervise server’s injustice(double issue, non-registration, etc) by audit query Time Stamp: To verify that Critical purchase period and time is correct and registration was processed within the time  Critical Purchase period It is published before a lottery game Delaying function cannot yield result within this period  Winning Entry Calculation 4. Previous Work – GS98 Client Server All seed values within P Winning Number

by Charlie Ham Lottery Previous Work – GS98  Problems  Only applicable to simple lottery such as number based one  Winning verification time is too long Needed the same time as total game period  Insider in server can forge or alter betting information  Attacking method computationally, information-theoretically on current cryptosystem is rapidly improving

by Charlie Ham Lottery Proposed scheme (tentative)  Notation

by Charlie Ham Lottery Proposed scheme (tentative) U U LO B B MHUHU SS 2

by Charlie Ham Lottery Proposed scheme (tentative)  Assumption  Lottery ticket is generated by Users themselves along with pre-defined rules  Lottery Organizer allows only allied Banks  Operation period is chosen considering transaction time in every components  Some details  Additional Information is depend on Bank’s requirement with which Bank can identify User  Payment is only paid when H U & Coupon are harmonized with stored data  Winning prize is given the account comes from secret sharing computation  Properties  User can trace all processes  Every process is handled in on-line  Amount of Communication data is low  It doesn’t need additional inquiry protocol User can naturally check through his bank note  Requirement R1 is strongly guaranteed  The other requirements are efficiently satisfied

by Charlie Ham Lottery Further Work  More communication data & computational complexity reduction  How to prevent Integrity of Message during transferring  Public key cryptosystem is necessary?  How to detect the total sold ticket number cheating by LO  Secret sharing is needed? Other methods?  Comparison with previous scheme

by Charlie Ham Lottery Reference  Tigerpools Korea,  Korea online lottery system co.ltd.,  K.Kobayashi, H.Morita, M.Hakuta, and T.Nakanowatari, An Electronic Soccer Lottery System that Uses Bit Commitment, IEICE00, Vol.E83-D, pp ,2000.  D.M.goldschlag, S.G.Stubblebine, Publicly Verifiable Lotteries: Applications of Delaying Functions, Proc.of Financial Cryptography 98, LNCS 1465, pp ,  Ross Anderson, How to cheat at the lottery, Proc. of Computer Security Applications Conference,  Ronal L.Rivest, Electronic Lottery Tickets as Micropayments, Proc.of Financial Cryptography 97, LNCS 1318, pp ,  A.Shamir, How to share a secret, CACM 22, pp , 1979.