A randomized protocol for signing contracts
Communications of the ACM
A calculus for cryptographic protocols
Information and Computation
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Efficient Algorithms for Verification of Equivalences for Probabilistic Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Typed event structures and the linear π-calculus
Theoretical Computer Science
Formal approaches to information-hiding (Tutorial)
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Calibrating the power of schedulers for probabilistic polynomial-time calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We propose a probabilistic variant of the pi-calculus as a framework to specify randomized security protocols and their intended properties. In order to express an verify the correctness of the protocols, we develop a probabilistic version of the testing semantics. We then illustrate these concepts on an extended example: the Partial Secret Exchange, a protocol which uses a randomized primitive, the Oblivious Transfer, to achieve fairness of information exchange between two parties.