English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Transparency protocols are protocols whose actions can be publicly monitoredby observers (such observers may include regulators, rights advocacy groups, orthe general public). The observed actions are typically usages of private keyssuch as decryptions, and signings. Examples of transparency protocols includecertificate transparency, cryptocurrency, transparent decryption, andelectronic voting. These protocols usually pose a challenge for automaticverification, because they involve sophisticated data types that have strongproperties, such as Merkle trees, that allow compact proofs of data presenceand tree extension.  We address this challenge by introducing new features in ProVerif, and amethodology for using them. With our methodology, it is possible to describethe data type quite abstractly, using ProVerif axioms, and prove thecorrectness of the protocol using those axioms as assumptions. Then, inseparate steps, one can define one or more concrete implementations of the datatype, and again use ProVerif to show that the implementations satisfy theassumptions that were coded as axioms. This helps make compositional proofs,splitting the proof burden into several manageable pieces. We illustrate themethodology and features by providing the first formal verification of thetransparent decryption and certificate transparency protocols with a precisemodelling of the Merkle tree data structure.

Automatic verification of transparency protocols (extended version)