Back to Results
First PageMeta Content
Support / Dirac measure / Applied mathematics / PP / Measure theory / Theoretical computer science / Analysis


Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol∗ Ran Canetti MIT and IBM TJ Watson Research Center ,
Add to Reading List

Document Date: 2007-02-16 11:54:21


Open Document

File Size: 700,56 KB

Share Result on Facebook

City

Lincoln / /

Company

A.1 Secure Asynchronous Reactive Systems / IBM / /

Currency

Rs / /

/

Event

FDA Phase / /

Facility

Ling Cheung The University / Roberto Segala The University / Moses Liskov The College of William / /

IndustryTerm

cryptographic protocols / security protocol / asynchronous reactive systems / multi-party secure protocols / cryptographic protocol / pure probabilistic systems / classic protocol / /

Organization

University of Verona / College of William and Mary / University of Nijmegen / MIT / Carnegie Mellon University / /

Person

Nancy Lynch / Roberto Segala / Ling Cheung / Olivier Pereira Universit / Moses Liskov / /

Position

PIOA model for the entire system / Time-Bounded Task Scheduler / scheduler / /

Product

Can01 / EGL85 / /

PublishedMedium

the Cryptology ePrint Archive / /

Technology

multi-party secure protocols / Oblivious Transfer protocol / classic protocol / security protocol / cryptographic protocol / analyzed protocol / analyzed protocols / Simulation / precisely specifying protocols / /

URL

http /

SocialTag