Universally composable security
From MaRDI portal
Recommendations
Cited in
(56)- The layered games framework for specifications and analysis of security protocols
- A universally composable framework for the privacy of email ecosystems
- High-performance multi-party computation for binary circuits based on oblivious transfer
- MoSS: modular security specifications framework
- Universally composable subversion-resilient cryptography
- Unclonable polymers and their cryptographic applications
- Embedding the UC model into the IITM model
- Oblivious RAM with worst-case logarithmic overhead
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger
- Policy-compliant signatures
- Universally Composable Authentication and Key-Exchange with Global PKI
- Synchronous universally composable computer networks
- A new security proof of practical cryptographic devices based on hardware, software and protocols
- A novel framework for protocol analysis
- scientific article; zbMATH DE number 2090639 (Why is no real title available?)
- A unified framework for concurrent security
- Advances in Cryptology - CRYPTO 2003
- The Layered Games Framework for Specifications and Analysis of Security Protocols
- Progress in Cryptology - INDOCRYPT 2004
- Long-term security and universal composability
- Formalizing delayed adaptive corruptions and the security of flooding networks
- A composable security treatment of ECVRF and batch verifications
- SecureBiNN: 3-party secure computation for binarized neural network inference
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Classically verifiable NIZK for QMA with preprocessing
- A universal composability framework for analysis of proxy threshold signature
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Completeness theorems for adaptively secure broadcast
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Universally composable auditable surveillance
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Agile cryptography: a universally composable approach
- Composable long-term security with rewinding
- Practically efficient private set intersection from trusted hardware with side-channels
- Asymptotically optimal message dissemination with applications to blockchains
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Privacy-preserving Dijkstra
- A fully-adaptive threshold partially-oblivious PRF
- Strong secret sharing with snitching
- srCPace: universally composable PAKE with subversion-resilience
- Secure computation with penalties, revisited: how to handle coins with various colors
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- zkSNARKs in the ROM with unconditional UC-security
- Distributing keys and random secrets with constant complexity
- Early stopping Byzantine agreement in (1+ ) f rounds
- Composing bridges
- The bitcoin backbone protocol: analysis and applications
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Universally composable password-hardened encryption
- Context-dependent threshold decryption and its applications
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Offline-online indifferentiability of cryptographic systems
- Universally composable succinct vector commitments and applications
- An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
- UC4Free! Existing threshold signatures are UC secure
This page was built for publication: Universally composable security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066937)
