Sabine Oechsner

Orcid: 0000-0002-4612-2471

According to our database1, Sabine Oechsner authored at least 19 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
How Hard Can It Be to Formalize a Proof? Lessons from Formalizing CryptoBox Three Times in EasyCrypt.
IACR Cryptol. ePrint Arch., 2025

Who Verifies the Verifiers?: Lessons Learned From Formally Verified Line-Point Zero-Knowledge.
IACR Commun. Cryptol., 2025

Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Satisfying Complex Data Security Requirements in Digital Business Ecosystems.
Proceedings of the 33rd IEEE International Requirements Engineering Conference, 2025

2024
Adaptive Distributional Security for Garbling Schemes with 풪(|x|) Online Complexity.
IACR Cryptol. ePrint Arch., 2024

2023
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

A State-Separating Proof for Yao's Garbling Scheme.
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

Adaptive Distributional Security for Garbling Schemes with 𝒪(|x|) Online Complexity.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Bringing State-Separating Proofs to EasyCrypt A Security Proof for Cryptobox.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021
TARDIS: A Foundation of Time-Lock Puzzles in UC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Formal security analysis of MPC-in-the-head zero-knowledge protocols.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
CRAFT: Composable Randomness and Almost Fairness from Time.
IACR Cryptol. ePrint Arch., 2020

TARDIS: Time And Relative Delays In Simulation.
IACR Cryptol. ePrint Arch., 2020

Adaptive Security of Practical Garbling Schemes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

2018
More Efficient Commitments from Structured Lattice Assumptions.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Compact Zero-Knowledge Proofs of Small Hamming Weight.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Towards Practical Lattice-Based One-Time Linkable Ring Signatures.
Proceedings of the Information and Communications Security - 20th International Conference, 2018

Computer-Aided Proofs for Multiparty Computation with Active Security.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2016
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems.
IACR Cryptol. ePrint Arch., 2016


  Loading...