Publications

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability

AuthID
P-00V-V2P

Author(s)

Barbosa, M

Barthe, G

Gregoire, B

Koutsos, A

Strub, PY

Editor(s)

Kim,Y;Kim,J;Vigna,G;Shi,E

Document Type

Proceedings Paper

Year published

2021

Published

in CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY in CCS

Pages: 2541-2563 (23)

Conference

Acm Sigsac Conference on Computer and Communications Security (Acm Ccs), Date: NOV 15-19, 2021, Location: ELECTR NETWORK, Sponsors: ACM SIGSAC, Assoc Comp Machinery

Indexing

Wos^®

Dblp^®/en/publications/view/912470

Crossref^®6

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.1145/3460120.3484548

Dblp: conf/ccs/BarbosaBGKS21

Wos: WOS:000768478302056

Export Publication Metadata

Marked List

Add to Marked List

Info

At this moment we don't have any links to full text documens.

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability

Useful Links

Get Help

Federated Authentication (Click on the image)

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability

Useful Links

Get Help