![]() | ![]() |
| 2009 | ||
|---|---|---|
| 6 | Catalin V. Birjoveanu: Secrecy for Bounded Security Protocols: Disequality Tests and an Intruder with Existentials Lead to Undecidability. BCI 2009: 22-27 | |
| 5 | Catalin V. Birjoveanu: Secrecy for Bounded Security Protocols without Freshness Check. SECURWARE 2009: 37-41 | |
| 2008 | ||
| 4 | Catalin V. Birjoveanu: Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests. SYNASC 2008: 193-196 | |
| 3 | Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, Constantin Enea, Ioana Boureanu: Secrecy for bounded security protocols with freshness check is NEXPTIME-complete. Journal of Computer Security 16(6): 689-712 (2008) | |
| 2006 | ||
| 2 | Catalin V. Birjoveanu: Secrecy for Security Protocols. Sci. Ann. Cuza Univ. 16: 5-38 (2006) | |
| 2005 | ||
| 1 | Ferucio Laurentiu Tiplea, Constantin Enea, Catalin V. Birjoveanu: Decidability and Complexity Results for Security Protocols. VISSAS 2005: 185-211 | |
| 1 | Ioana Boureanu | [3] |
| 2 | Constantin Enea | [1] [3] |
| 3 | Ferucio Laurentiu Tiplea | [1] [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page