Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human-oriented encryption: from Solitaire.

Slides:

Advertisements

Similar presentations

Chapter 09 AI techniques in different game genres (Puzzle/Card/Shooting)

Advertisements

The Psychic Card Trick. Instructions: This PowerPoint training game is designed more as a bit of fun to break.

Efficient Information Retrieval for Ranked Queries in Cost-Effective Cloud Environments Presenter: Qin Liu a,b Joint work with Chiu C. Tan b, Jie Wu b,

© UCL Crypto group – October 2004 – DIMACS - Smart Theory Meets Smartcard Practice Smart Theory Meets Smartcard Practice Smart Theory Meets Smartcard Practice.

1 Vipul Goyal Abhishek Jain UCLA On the Round Complexity of Covert Computation.

Mathemagic: what happens at the intersection between magic and Math? Talk by: Kush Fanikiso Advised by: Professor Steven J. Miller.

Zero-Knowledge Proofs J.W. Pope M.S. – Mathematics May 2004.

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

CMSC 414 Computer (and Network) Security Lecture 2 Jonathan Katz.

Aims and Motivation The goal of this project is to produce a secure and dependable way of distributing and storing data securely over a distributed system.

Announcements: 1. Congrats on reaching the halfway point once again! 2. Reminder: HW5 due tomorrow, HW6 due Tuesday after break 3. Term project groups.

Teaching Instructional Technology Archetypes with a Deck of Cards: Anthony Betrus, William Sugar, & Mike Rixman AECT 2000 Long Beach, California Session.

Building Memory… Notes from class on 11/13/06. The Game Think about what types of objects we will need in our system and some of the properties and capabilities.

Computer Science 5 Spring 2003 Module 4 10/10/03 8:37 AM.

CS 106 Introduction to Computer Science I 11 / 08 / 2006 Instructor: Michael Eckmann.

1 CIS /204–Spring 2008 Recitation 13 – Last Recitation Friday, April 25, 2008.

Simple Random Sample How to make sure your sample is good... or hopefully good... maybe...

[[ NET-CENTRIC CAPABILITIES TURBULENCE TECHNICAL OVERVIEW : AUGUST 2007 ]] MATH CAREERS AT NATIONAL SECURITY AGENCY Jill Calhoun May 2010.

Information Theory and Security

CSCD 330 Network Programming Winter 2012 Lecture 1 - Course Details.

CS 106 Introduction to Computer Science I 04 / 07 / 2010 Instructor: Michael Eckmann.

Computer Security CS 426 Lecture 3

Solitaire CRyptography Applications Bistro 8 April 2004.

Dan Boneh Stream ciphers The One Time Pad Online Cryptography Course Dan Boneh.

Theory (and Application) Learning: A change in human performance or performance potential that results from practice or other experience and endures over.

Lloyd, Seth. “Ultimate Limits to Computation”, Nature, August 31, » Current laptop: speed: ~10 9 operations per sec. memory: ~10 10 bits » Analysis.

Poker UML and ADT design plan.

Host and Application Security Lesson 3: What is Information?

Modules. A module is a file containing Python definitions and statements intended for use in other Python programs. There are many modules as part of.

CIT 590 Examples Debugging. Agenda This class is an experiment in letting students learn by just doing things as opposed to me talking all the time! So.

The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.

Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.

LOGO Hardware side of Cryptography Anestis Bechtsoudis Patra 2010.

Dr. Susan Al Naqshbandi The word “Cryptography” is derived from Greek words κρυπτός kryptós meaning “hidden” and γράφω gráfo meaning.

Randomness Has structure in the long run Randomness seems “Fair” 1) Nobody can predict the outcome ahead of time. 2) Some underlying set of outcomes are.

Career Advancement Center Workshops Active Listening Skills T IMOTHY S CANLON Active Listening Skills T IMOTHY S CANLON APCO Curriculum Developer August.

Copyright © 2014 Pearson Education, Inc. All rights reserved Chapter 5 Modeling Variation with Probability.

Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.

AVALANCHE EFFECT IN THE FAMILY OF BLOCK CIPHERS “SD-(n,k)” University “Ss Cyril and Methodius” – Skopje, RM S. Markovski, PhD A. Mileva, MSc D. Gligoroski,

Password authentication Basic idea –User has a secret password –System checks password to authenticate user Issues –How is password stored? –How does system.

Description of a New Variable-Length Key, 64-Bit Block Cipher (BLOWFISH) Bruce Schneier BY Sunitha Thodupunuri.

Richard Kelley Motion Planning on a GPU. Last Time Nvidia’s white paper Productive discussion.

Lecture 2 Basics of probability in statistical simulation and stochastic programming Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius,

Network Address Translation External/ Internal/. OVERLOADING In Overloading, each computer on the private network is translated to the same IP address;

1 Monte-Carlo Methods in AI: Overview Prasad Tadepalli.

The “Taint” Leakage Model Ron Rivest Crypto in the Clouds Workshop, MIT Rump Session Talk August 4, 2009.

Supporting Early Writing Mrs. Bracchi. Children’s writing is based on skills and understandings which they develop as babies and toddlers. Before they.

Variable Block Length Encryption Mathemagical Encryption By Canek Acosta.

Lecture Topics: 12/06 SSL Final Exam HW 7 & 8 Important concepts in 410 Other references Evaluations.

DCI – rump session CR ‘05 Jean-Jacques Quisquater DCI – rump session CR ‘05 Jean-Jacques Quisquater Digital Cinema System Specification V1.0 Jean-Jacques.

Security March 9, Security What is security?  Techniques that control access to use a shared resource  Uses of shared resource must be authorized.

Probability Trash-ball

多媒體網路安全實驗室 Practical Searching Over Encrypted Data By Private Information Retrieval Date： Reporter: Chien-Wen Huang 出處: GLOBECOM 2010, 2010 IEEE.

Chapter 12 Sections 1-3. Bell Ringer 6.The Excite Poll is an online poll at poll.excite.com. You click on an answer to become part of the sample. One.

Implementing Secure IRC App with Elgamal By Hyungki Choi ID : Date :

Cryptography CS Lecture 19 Prof. Amit Sahai.

Geobacter – rump session CR ‘05 Jean-Jacques Quisquater Geobacter – rump session CR ‘05 Jean-Jacques Quisquater The geobacter side-channel attack: when.

Key Wrap Algorithm.

CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.

Modelling Complex Systems Video 4: A simple example in a complex way.

Introduction to programming in java Lecture 16 Random.

Cryptography Survey.

Understanding Randomness

Cryptography Survey.

STREAM CIPHERS by Jennifer Seberry.

The “Taint” Leakage Model

Freebird Midnight Train to GA

Review of Cryptography: Symmetric and Asymmetric Crypto Advanced Network Security Peter Reiher August, 2014.

Presentation transcript:

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human-oriented encryption: from Solitaire to Multitaire Jean-Jacques Quisquater and BoF participants UCL Crypto Group Université catholique de Louvain August 16, 2005 Rump session Crypto

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater Solitaire (Bruce Schneier)   Solitaire gets its security from the inherent randomness in a shuffled deck of cards. By manipulating this deck, a communicant can create a string of "random" letters that he then combines with his message. Of course Solitaire can be simulated on a computer, but it is designed to be implemented by hand.  Solitaire may be low-tech, but its security is intended to be high-tech.

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater BoF, this afternoon  Ten people discussed during one hour,  How to improve,  How to use many people not only one.

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater Ideas  Use pro magicians in order to perform very good and reproductible shuffles  Brent Morris (NSA) likes to say that he's the only person with a doctorate in card shuffling  Diaconis, P., R.L. Graham, and W.M. Kantor The mathematics of perfect shuffles. Advances in Applied Mathematics 4:175.  Morris, S.B Magic Tricks, Card Shuffling, and Dynamic Computer Memories: The Mathematics of the Perfect Shuffle. Washington, D.C.: Mathematical Association of America.

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater More techniques  Using automata theory (life game of Conway?)  Simulating a large nonlinear feedback register by using a lot of people around a table and cards for storing and communicating information (flipping card): here a lot of problems appear and many optimisations are possible  Random generation?  Use of other games (Chess, Go,...?),

Human crypto rump session CR ‘05 Jean-Jacques Quisquater Human crypto rump session CR ‘05 Jean-Jacques Quisquater Conclusions  Many open problems.  Performances, new criteria of design, taxonomy,...  But is it useful?  Yes, creating a funny BoF and giving a rump talk. Thanks to the participants. More next year.