Yassine Lakhnech, Laurent Mazaré  Home/Search
Context
Related
| iacr.org/2005/098.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A predicate is opaque for a given system, if an adversary will never be able to establish truth or falsehood of the predicate for any observed computation. This notion has been essentially introduced and studied in the context of transition systems whether describing the semantics of programs, security protocols or other systems. In this paper, we are interested in studying opacity in the probabilistic computational world. Indeed, in other settings, as in the Dolev-Yao model for instance,... (Update)
Active bibliography (related documents): More All
0.8: Computationally Sound Verification of Security Protocols.. - Lakhnech, Mazare (2005) (Correct)
0.6: (De)Compositions of Cryptographic Schemes and their.. - Janvier, Lakhnech.. (2005) (Correct)
0.5: Spreading Alerts Quietly - And The Subgroup (2005) (Correct)
Similar documents based on text: More All
0.3: Abstracting WS1S Systems to Verify Parameterized Networks - Baukus, Bensalem.. (2000) (Correct)
0.3: Verifying Universal Properties of Parameterized Networks - Baukus, Lakhnech, Stahl (2000) (Correct)
0.3: Iterating Transducers - Dennis Dams Yassine (2001) (Correct)
BibTeX entry: (Update)
@misc{ lakhnech-probabilistic,
author = "Yassine Lakhnech and Laurent Mazaré",
title = "Probabilistic Opacity for a Passive Adversary and its Application to Chaum's
Voting Scheme",
url = "citeseer.ist.psu.edu/lakhnech05probabilistic.html" }
Citations (may not include all citations):317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
56 Formal eavesdropping and its computational interpretation - Abadi, Jurgens - 2001
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
33 Probabilistic interference (context) - Gray - 1990
33 Semantics and program analysis of computationally secure inf.. - Laud - 2001
22 CSP and anonymity - Schneider, Sidiropoulos - 1996
21 Symmetric encryption in automatic analyses for confidentiali.. - Laud - 2004
16 Computational probabilistic non-interference - Backes, Pfitzmann - 2002
12 Reconciling two views of cryptography (context) - Abadi, Rogaway - 2000
11 automated proofs for security protocols (context) - Cortier, Warinschi - 2005
7 Completing the picture: Soundness of formal encryption in th.. (context) - Janvier, Lakhnech et al. - 2005
4 A simple public-key cryptosystem with a double trapdoor decr.. (context) - Bresson, Catalano et al. - 2003
3 A taxonomy of trace-based security properties for CCS (context) - Focardi, Gorrieri - 1994
3 Randomness re-use in multi-recipient encryption schemes (context) - Bellare, Boldyreva et al. - 2003
3 compositions of cryptographic schemes and their applications.. - Janvier, Lakhnech et al. - 2005
2 voter-verifiable election scheme (context) - Chaum, Ryan et al. - 2004
1 Opacity generalised to transition systems (context) - Bryans, Koutny et al. - 2004
1 Rapid mixing and security of chaum's visual electronic votin.. (context) - Gomukiewicz, Klonowski et al. - 2003
1 voting: Secret-ballot receipts: True voter-verifiable electi.. (context) - Chaum - 2004
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC