| Provably secure ciphertext policy ABE L Cheung, C Newport Proceedings of the 14th ACM conference on Computer and communications …, 2007 | 1189 | 2007 |
| Time-bounded task-PIOAs: A framework for analyzing security protocols R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala International Symposium on Distributed Computing, 238-253, 2006 | 77 | 2006 |
| Collusion-resistant group key management using attribute-based encryption L Cheung, JA Cooley, R Khazan, C Newport Group-Oriented Cryptographic Protocols 23, 2007 | 73 | 2007 |
| Switched PIOA: Parallel composition via distributed scheduling L Cheung, N Lynch, R Segala, F Vaandrager Theoretical Computer Science 365 (1-2), 83-108, 2006 | 71 | 2006 |
| Task-structured probabilistic I/O automata R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala 2006 8th International Workshop on Discrete Event Systems, 207-214, 2006 | 62 | 2006 |
| A testing scenario for probabilistic processes L Cheung, M Stoelinga, F Vaandrager Journal of the ACM (JACM) 54 (6), 29, 2007 | 61 | 2007 |
| A testing scenario for probabilistic processes L Cheung, MIA Stoelinga, FW Vaandrager [Sl]: Institute for Computing and Information Sciences, Radboud Un, 2006 | 61 | 2006 |
| Analyzing security protocols using time-bounded task-PIOAs R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala Discrete Event Dynamic Systems 18 (1), 111-159, 2008 | 40 | 2008 |
| Reconciling nondeterministic and probabilistic choices L Cheung [Sl: sn], 2006 | 39 | 2006 |
| Switched probabilistic I/O automata L Cheung, N Lynch, R Segala, F Vaandrager International Colloquium on Theoretical Aspects of Computing, 494-510, 2004 | 27 | 2004 |
| Using probabilistic I/O automata to analyze an oblivious transfer protocol R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, R Segala | 26 | 2005 |
| Compositional security for task-pioas R Canetti, L Cheung, D Kaynar, N Lynch, O Pereira 20th IEEE Computer Security Foundations Symposium (CSF'07), 125-139, 2007 | 23 | 2007 |
| Task-structured probabilistic I/O automata R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala Journal of Computer and System Sciences 94, 63-97, 2018 | 19 | 2018 |
| Randomized wait-free consensus using an atomicity assumption L Cheung International Conference On Principles Of Distributed Systems, 47-60, 2005 | 19 | 2005 |
| Modeling Computational Security in Long-Lived Systems, Version 2. R Canetti, L Cheung, DK Kaynar, NA Lynch, O Pereira IACR Cryptology ePrint Archive 2008, 492, 2008 | 18* | 2008 |
| Task-structured probabilistic I R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala O automata. Tech. Report MIT-CSAIL-TR-2006-060, MIT, Cambridge, 2006 | 18 | 2006 |
| Using task-structured probabilistic I/O automata to analyze an oblivious transfer protocol R Canetti, L Cheung, D Kaynar, M Liskov, N Lynch, O Pereira, R Segala | 17 | 2007 |
| Modeling computational security in long-lived systems R Canetti, L Cheung, D Kaynar, N Lynch, O Pereira International Conference on Concurrency Theory, 114-130, 2008 | 14 | 2008 |
| On the Role of Scheduling in Simulation-Based Security. R Canetti, L Cheung, NA Lynch, O Pereira IACR Cryptology ePrint Archive 2007, 102, 2007 | 14 | 2007 |
| Verifying Statistical Zero Knowledge with Approximate Implementations. L Cheung, S Mitra, O Pereira IACR Cryptology ePrint Archive 2007, 195, 2007 | 9 | 2007 |
Nancy LynchProfessor of EECS, MITVerified email at csail.mit.edu
