Author of the publication

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.

, , , , , , and . DISC, volume 4167 of Lecture Notes in Computer Science, page 238-253. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Randomized Wait-Free Consensus Using an Atomicity Assumption.. OPODIS, volume 3974 of Lecture Notes in Computer Science, page 47-60. Springer, (2005)Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol., , , , , , and . IACR Cryptology ePrint Archive, (2005)Analyzing Security Protocols Using Time-Bounded Task-PIOAs., , , , , , and . Discret. Event Dyn. Syst., 18 (1): 111-159 (2008)Task-structured probabilistic I/O automata., , , , , , and . J. Comput. Syst. Sci., (2018)Collusion-Resistant Group Key Management Using Attribute-Based Encryption., , , and . IACR Cryptology ePrint Archive, (2007)Provably secure ciphertext policy ABE., and . ACM Conference on Computer and Communications Security, page 456-465. ACM, (2007)Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols., , , , , , and . DISC, volume 4167 of Lecture Notes in Computer Science, page 238-253. Springer, (2006)Randomized Wait-Free Consensus Using an Atomicity Assumption. Principles of Distributed Systems, (2006)A testing scenario for probabilistic processes., , and . J. ACM, 54 (6): 29 (2007)Concise Graphs and Functional Bisimulations., and . CMCIM/GETCO@CONCUR, volume 100 of Electronic Notes in Theoretical Computer Science, page 5-29. Elsevier, (2003)