Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Formally Verifying the Security of Probabilistic Oblivious Algorithms
Formally Verifying the Security of Probabilistic Oblivious Algorithms
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Yan, Pengbo
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.17034603
Similar Items
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms (Extended Version)
by: Yan, Pengbo, et al.
Published: (2024)
VOW: Verifiable and Oblivious Watermark Detection for Large Language Models
by: Luan, Xiaokun, et al.
Published: (2026)
Formalizing, Verifying and Applying ISA Security Guarantees as Universal Contracts
by: Huyghebaert, Sander, et al.
Published: (2023)
A Scalable Formal Verification Methodology for Data-Oblivious Hardware
by: Deutschmann, Lucas, et al.
Published: (2023)
SONNI: Secure Oblivious Neural Network Inference
by: Sperling, Luke, et al.
Published: (2025)