Ling Cheung's Publications
Recent Work
- R. Canetti, L. Cheung, D. Kaynar, N. Lynch, and O. Pereira.
A Model for Long-Lived and Timed Systems. In progress.
- L. Cheung, S. Mitra, and O. Pereira.
Verifying Statistical Zero Knowledge with Approximate
Implementations. Cryptology ePrint Archive Report
2007/195.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala.
Task-Structured Probabilistic I/O Automata. Submitted to
Information and Computation.
- L. Cheung, M. Stoelinga, and F. Vaandrager.
A Testing Scenario for Probabilistic Processes.
Submitted to JACM.
2007
- L. Cheung and C. Newport.
Provably Secure Ciphertext-Policy Attribute-Based
Encryption. In Proceedings of the 14th ACM
Conference on Computer and Communications Security (CCS)
2007.
- L. Cheung, J.A. Cooley, R. Khazan, and C. Newport.
Collusion-Resistant Group Key Management Using
Attribute-Based Encryption. Presented at the First
International Workshop on Group-Oriented Cryptographic
Protocols (GOCP) 2007.
- R. Canetti, L. Cheung, D. Kaynar, N. Lynch, and
O. Pereira.
Compositional Security for Task-PIOAs. In
Proceedings of the 20th IEEE Computer Security Foundations
Symposium (CSF) 2007.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala. Analyzing Security Protocol Using
Time-Bounded Task-PIOAs. To appear in Journal of
Discrete Event Dynamic Systems (DEDS).
- R. Canetti, L. Cheung, N. Lynch, and O. Pereira.
On the Role of Scheduling in Simulation-Based Security.
Presented at the Workshop on Issues in the Theory of
Security (WITS) 2007.
2006
- L. Cheung, N. Lynch, R. Segala, and F. Vaandrager.
Switched PIOA: Parallel Composition via Distributed
Scheduling. In Theoretical Computer Science
365(1-2):83-108, November 2006.
- L. Cheung.
Reconciling Nondeterministic and Probabilistic Choices.
Ph.D. Dissertation, Radboud University Nijmegen, September 2006.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala.
Time-bounded Task-PIOAs: A Framework for Analyzing Security
Protocols. In Proceedings of the 20th International
Symposium on Distributed Computing (DISC) 2006.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala.
Task-Structured Probabilistic I/O Automata. In
Proceedings of the 8th International Workshop on Discrete
Event Systems (WODES) 2006.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala.
Using Task-Structured Probabilistic I/O Automata to Analyze
Cryptographic Protocols. Presented at the Workshop
on Formal and Computational Cryptography (FCC) 2006.
2005
- L. Cheung.
Randomized Wait-Free Consensus Using An Atomicity
Assumption. In Proceedings of the 9th International
Conference on Principles of Distributed Systems (OPODIS)
2005.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala.
Using Probabilistic I/O Automata to Analyze an Oblivious
Transfer Protocol. Cryptology ePrint Archive
Report 2005/452. Latest revision: February 2007.
- R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch,
O. Pereira, and R. Segala. Using Probabilistic I/O Automata to
Improve the Analysis of Cryptographic Protocols. In ERCIM
News 63, pages 40--41, October 2005.
- L. Cheung and M. Hendriks.
Causal Dependencies in Parallel Composition of Stochastic
Processes. Technical Report ICIS-R05020, Institute for
Computing and Information Sciences, Radboud University
Nijmegen, September 2005.
- L. Cheung, N. Lynch, R. Segala, and F. Vaandrager.
Switched Probabilistic I/O Automata. In Proceedings
of the First International Colloquium on Theoretical
Aspects of Computing (ICTAC), LNCS 3407, pages 494--510,
Springer Verlag, 2005.
2004
Last modified: Tue Sep 25 10:35:26 EDT 2007