Universally Composable Security with Global Setup
From MaRDI portal
Publication:3596372
DOI10.1007/978-3-540-70936-7_4zbMATH Open1129.94014OpenAlexW1562226375MaRDI QIDQ3596372FDOQ3596372
Authors: Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish 
Publication date: 30 August 2007
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_4
Recommendations
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- New notions of security: achieving universal composability without trusted setup
- Long-term security and universal composability
- Universal composability from essentially any trusted setup
- Distributing the setup in universally composable multi-party computation
Cited In (91)
- On black-box complexity of universally composable security in the CRS model
- Everlasting multi-party computation
- Long-Term Security and Universal Composability
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Order-fairness for Byzantine consensus
- GNUC: a new universal composability framework
- MPC with synchronous security and asynchronous responsiveness
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Two-round adaptively secure multiparty computation from standard assumptions
- Safely composing security protocols
- The IITM model: a simple and expressive model for universal composability
- Identity-based trapdoor mercurial commitments and applications
- Better two-round adaptive multi-party computation
- Removing erasures with explainable hash proof systems
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- A note on universal composable zero-knowledge in the common reference string model
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- Possibility and impossibility results for selective decommitments
- Long-term security and universal composability
- The wonderful world of global random oracles
- Payment trees: low collateral payments for payment channel networks
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Linearly homomorphic structure-preserving signatures and their applications
- Universal composition with responsive environments
- UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module
- Cryptography in the multi-string model
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Concurrently composable non-interactive secure computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Adaptive hardness and composable security in the plain model from standard assumptions
- 3-message zero knowledge against human ignorance
- Composable and finite computational security of quantum message transmission
- Embedding the UC model into the IITM model
- Signatures from sequential-OR proofs
- Dynamic ad hoc clock synchronization
- TARDIS: a foundation of time-lock puzzles in UC
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Formal abstractions for attested execution secure processors
- Compact and efficient UC commitments under atomic-exchanges
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Multiparty cardinality testing for threshold private intersection
- Steel: composable hardware-based stateful and randomised functional encryption
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- New notions of security: achieving universal composability without trusted setup
- Universal composition with global subroutines: capturing global setup within plain UC
- Bringing people of different beliefs together to do UC
- Concurrently composable security with shielded super-polynomial simulators
- How to Build a Hash Function from Any Collision-Resistant Function
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- A new approach to efficient non-malleable zero-knowledge
- On constant-round concurrent non-malleable proof systems
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Pattern matching on encrypted streams
- Universally Composable Authentication and Key-Exchange with Global PKI
- A second note on the feasibility of generalized universal composability
- Universally composable security with local adversaries
- A universally composable framework for the privacy of email ecosystems
- Non-interactive secure computation from one-way functions
- Feasibility and infeasibility of secure computation with malicious PUFs
- Secure computation without authentication
- Quantifying the security cost of migrating protocols to practice
- Universally Composable Adaptive Oblivious Transfer
- Eagle: efficient privacy preserving smart contracts
- On the correlation complexity of MPC with cheater identification
- Taming adaptivity in YOSO protocols: the modular way
- Astrolabous: a universally composable time-lock encryption scheme
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Composable long-term security with rewinding
- GUC-secure commitments via random oracles: new impossibility and feasibility
- Practically efficient private set intersection from trusted hardware with side-channels
- Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery
- Endemic oblivious transfer via random oracles, revisited
- Witness-succinct universally-composable SNARKs
- Algebraic adversaries in the universal composability framework
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Incoercible multi-party computation and universally composable receipt-free voting
- Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Generalized channels from limited blockchain scripts and adaptor signatures
- Adaptive security of multi-party protocols, revisited
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger
- Etherless Ethereum Tokens: simulating native tokens in Ethereum
- A note on the feasibility of generalised universal composability
This page was built for publication: Universally Composable Security with Global Setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596372)
