Specifying and verifying secrecy in workflows with arbitrarily many agents

DOI10.1007/978-3-319-46520-3_11MaRDI QIDQ1990507zbMATHOpenAlexFDO

Authors Yanyan Li

Publication date 25 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-46520-3_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Multi-clients verifiable computation via conditional disclosure of secrets
• Verifying Agents’ Conformance with Multiparty Protocols
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Computationally sound abstraction and verification of secure multi-party computations
• Formal treatment of verifiable privacy-preserving data-aggregation protocols
• Cryptographic agents: towards a unified theory of computing on encrypted data
• Multi-client verifiable computation with stronger security guarantees

Cited in

(4)

• Stratified guarded first-order transition systems
• Specifying and verifying organizational security properties in first-order logic
• WorkFlow analyzed for security and privacy in using databases
• Verification of composed array-based systems with applications to security-aware workflows

This page was built for publication: Specifying and verifying secrecy in workflows with arbitrarily many agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990507)