1 / 19

HOW TO PLAN A COUP D’ETAT

YINMENG ZHANG. COVERT MULTI-PARTY COMPUTATION. HOW TO PLAN A COUP D’ETAT. ALADDIN REU 2005. LUIS VON AHN MANUEL BLUM. CHARLIE’S ANGEL. ALLOWS TWO PARTIES WITH SECRET INPUTS X AND Y TO LEARN F(X,Y) BUT NOTHING ELSE. COVERT. IDEAL MODEL. MULTI-PARTY COMPUTATION.

tokala
Download Presentation

HOW TO PLAN A COUP D’ETAT

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. YINMENG ZHANG COVERT MULTI-PARTY COMPUTATION HOW TO PLAN A COUP D’ETAT ALADDIN REU 2005 LUIS VON AHN MANUEL BLUM

  2. CHARLIE’S ANGEL ALLOWS TWO PARTIES WITH SECRET INPUTS X AND Y TO LEARN F(X,Y) BUT NOTHING ELSE COVERT IDEAL MODEL MULTI-PARTY COMPUTATION TWO-PARTY COMPUTATION BOB ALICE

  3. THERE ARE ONLY THREE ANGELS. NONE OF THEM KNOW ALICE. OR BOB.

  4. SECURE TWO PARTY COMPUTATION: YAO

  5. LET’S NOT GET MARRIED 1 IF X>Y 0 OTHERWISE F(X,Y) = JEN BEN $45 MILLION $32 MILLION F(X,Y)=1

  6. I ALICE ALICE BOB EVERYBODY! BOB LIKES ME! WHAT A LOSER! LET’S FIND OUT IF WE BOTH LIKE EACH OTHER! WHY WOULD WE WANT TO DO THAT? OMG …

  7. COVERT TWO PARTY COMPUTATION: VON AHN,HOPPER,LANGFORD

  8. COVERT TWO-PARTY COMPUTATION EXTERNAL COVERTNESS NO OUTSIDE OBSERVER CAN TELL IF THE TWO PARTIES ARE RUNNING A COMPUTATION OR JUST COMMUNICATING AS NORMAL INTERNAL COVERTNESS AFTER LEARNING F(X,Y), EACH PARTY CAN ONLY TELL WHETHER THE OTHER PARTICIPATED IF THEY CAN DISTINGUISH F(X,Y) FROM RANDOM BITS

  9. WHO KNOWS WHAT? WE ASSUME THAT BOTH PARTIES KNOW THE FUNCTION THEY WISH TO EVALUATE BOTH KNOW WHICH ROLE THEY ARE TO PLAY IN THE EVALUATION BOTH KNOW WHEN TO START COMPUTING

  10. ORDINARY COMMUNICATION MESSAGES ARE DRAWN FROM A SET D TIME PROCEEDS IN DISCRETE TIMESTEPS EACH PARTY MAINTAINS A HISTORY h OF ALL DOCUMENTS THEY SENT AND RECEIVED TO EACH PARTY P, WE ASSOCIATE A FAMILY OF PROBABILITY DISTRIBUTIONS ON D: {BhP}

  11. CHANNEL ORACLE ORDINARY-LIKE COMMUNICATION GIVEN ANY HISTORY h, P WANTS TO BE ABLE TO SAMPLE FROM THE CHANNEL BhP

  12. YOU LEFT IT NEXT TO MY GRENADES THE AXIS OF EVIL SHALL PREVAIL! I GUESS I CAN USE MY BAZOOKA HAVE YOU SEEN MY AK-47? THE WAR ON TERROR HE WORKS FOR MI-6 CIA AGENT HE WORKS FOR CIA MI-6 AGENT

  13. HE WORKS FOR MI-6 HE WORKS FOR CIA THE WAR ON TERROR THE UTTERANCES CONTAINED A COVERT TWO-PARTYCOMPUTATION THE FUNCTION F VERIFIED THE CREDENTIALS SINCE BOTH WERE VALID, IT OUTPUT 1K X WAS A CREDENTIAL SIGNED BY CIA AND Y WAS SIGNED BY MI-6 FOR ANY OTHER INPUTS, F OUTPUTS A RANDOM VALUE

  14. SECURE MULTI PARTY COMPUTATION: GOLDREICH,MICALI,WIGDERSON

  15. SECURE MULTI PARTY COMPUTATION: YINMENG ZHANG??? WHAT I DID ON MY SUMMER VACATION [THE TEASER TRAILER]

  16. COVERT MULTI-PARTY COMPUTATION EVERYTHING IS HARDER WITH MORE PEOPLE ALLOWS N PARTIES WITH SECRET INPUTS X1…XN TO LEARN F(X1,…,XN) BUT NOTHING ELSE

  17. COVERT MULTI-PARTY COMPUTATION: THE ADVERSARY WIMPY BUSYBODIES [SEMI-HONEST] ALL’S FAIR IN LOVE AND CRYPTOGRAPHY [MALICIOUS] WHAT THINGS ARE IMPOSSIBLE TO PROTECT AGAINST?

  18. COVERT MULTI-PARTY COMPUTATION: WHO KNOWS WHAT? WHO’S COMPUTING? HOW MANY PEOPLE ARE COMPUTING? HOW MANY PEOPLE WERE COMPUTING, GOT BORED AND STOPPED[ABORT]?

More Related