Ioana Boureanu

Orcid: 0000-0001-5864-777X

According to our database1, Ioana Boureanu authored at least 50 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Epistemic Model Checking for Privacy.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

2023
Formally Verifying the Security and Privacy of an Adopted Standard for Software-Update in Cars: Verifying Uptane 2.0.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023

Fine-Grained Trackability in Protocol Executions.
Proceedings of the 30th Annual Network and Distributed System Security Symposium, 2023

Program Semantics and Verification Technique for AI-Centred Programs.
Proceedings of the Formal Methods - 25th International Symposium, 2023

Systematic Improvement of Access-Stratum Security in Mobile Networks.
Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

Formalising Application-Driven Authentication & Access-Control based on Users' Companion Devices.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

Automatically Verifying Expressive Epistemic Properties of Programs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
How fast do you heal? A taxonomy for post-compromise security in secure-channel establishment.
IACR Cryptol. ePrint Arch., 2022

Program Semantics and a Verification Technique for Knowledge-Based Multi-Agent Systems.
CoRR, 2022

Model Checking Strategic Abilities in Information-sharing Systems.
CoRR, 2022

Practical EMV Relay Protection.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

The 5G Key-Establishment Stack: In-Depth Formal Verification and Experimentation.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Mechanised Models and Proofs for Distance-Bounding.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

From Relay Attacks to Distance-Bounding Protocols.
Proceedings of the Security of Ubiquitous Computing Systems, 2021

2020
LURK: Server-Controlled TLS Delegation.
IACR Cryptol. ePrint Arch., 2020

Precise and Mechanised Models and Proofs for Distance-Bounding and an Application to Contactless Payments.
IACR Cryptol. ePrint Arch., 2020

Extensive Security Verification of the LoRaWAN Key-Establishment: Insecurities & Patches.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

Provable-Security Model for Strong Proximity-based Attacks: With Application to Contactless Payments.
Proceedings of the ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security, 2020

Security Analysis and Implementation of Relay-Resistant Contactless Payments.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Security of Distance-Bounding: A Survey.
ACM Comput. Surv., 2019

Model Checking ATL* on vCGS.
CoRR, 2019

Distance bounding under different assumptions: opinion.
Proceedings of the 12th Conference on Security and Privacy in Wireless and Mobile Networks, 2019

Here and There at Once, with my Mobile Phone!
Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, 2019

Short Paper: Making Contactless EMV Robust Against Rogue Readers Colluding with Relay Attackers.
Proceedings of the Financial Cryptography and Data Security, 2019

Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Another Look at Relay and Distance-based Attacks in Contactless Payments.
IACR Cryptol. ePrint Arch., 2018

A Formal Treatment of Accountable Proxying Over TLS.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

2017
Breaking and Fixing the HB+DB protocol.
IACR Cryptol. ePrint Arch., 2017

A Novel Symbolic Approach to Verifying Epistemic Properties of Programs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Content delivery over TLS: a cryptographic analysis of keyless SSL.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

2016
Verifying Security Properties in Unbounded Multiagent Systems.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Practical and provably secure distance-bounding.
J. Comput. Secur., 2015

Challenges in Distance Bounding.
IEEE Secur. Priv., 2015

Towards Secure Distance Bounding.
IACR Cryptol. ePrint Arch., 2015

The Limits of Composable Crypto with Transferable Setup Devices.
Proceedings of the 10th ACM Symposium on Information, 2015

2014
Optimal Proximity Proofs.
IACR Cryptol. ePrint Arch., 2014

Compact and Efficient UC Commitments Under Atomic-Exchanges.
Proceedings of the Information Security and Cryptology - ICISC 2014, 2014

2013
Practical & Provably Secure Distance-Bounding.
IACR Cryptol. ePrint Arch., 2013

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence.
Sci. Ann. Comput. Sci., 2013

Input-Aware Equivocable Commitments and UC-secure Commitments with Atomic Exchanges.
Proceedings of the Provable Security - 7th International Conference, 2013

Secure and Lightweight Distance-Bounding.
Proceedings of the Lightweight Cryptography for Security and Privacy, 2013

Primeless Factoring-Based Cryptography - -Solving the Complexity Bottleneck of Public-Key Generation-.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Several Weak Bit-Commitments Using Seal-Once Tamper-Evident Devices.
IACR Cryptol. ePrint Arch., 2012

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols - PRF-ness alone Does Not Stop the Frauds!
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks.
Proceedings of the Information Security and Cryptology - 8th International Conference, 2012

Automatic verification of epistemic specifications under convergent equational theories.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2010
Model checking detectability of attacks in multiagent systems.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Automatic verification of temporal-epistemic properties of cryptographic protocols.
J. Appl. Non Class. Logics, 2009

2008
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete.
J. Comput. Secur., 2008

2005
Weighted Threshold Secret Sharing Based on the Chinese Remainder Theorem.
Sci. Ann. Cuza Univ., 2005


  Loading...