Universally Composable Security with Global Setup
From MaRDI portal
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
(only showing first 100 items - show all)- A note on universal composable zero-knowledge in the common reference string model
- Safely composing security protocols
- Two-round adaptively secure multiparty computation from standard assumptions
- Pattern matching on encrypted streams
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- The wonderful world of global random oracles
- Non-interactive secure computation from one-way functions
- A universally composable framework for the privacy of email ecosystems
- On constant-round concurrent non-malleable proof systems
- Everlasting multi-party computation
- Signatures from sequential-OR proofs
- Dynamic ad hoc clock synchronization
- TARDIS: a foundation of time-lock puzzles in UC
- Multiparty cardinality testing for threshold private intersection
- Steel: composable hardware-based stateful and randomised functional encryption
- Quantifying the security cost of migrating protocols to practice
- Order-fairness for Byzantine consensus
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Universal composition with global subroutines: capturing global setup within plain UC
- Payment trees: low collateral payments for payment channel networks
- UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module
- Embedding the UC model into the IITM model
- Feasibility and infeasibility of secure computation with malicious PUFs
- Composable and finite computational security of quantum message transmission
- The IITM model: a simple and expressive model for universal composability
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- On black-box complexity of universally composable security in the CRS model
- GNUC: a new universal composability framework
- MPC with synchronous security and asynchronous responsiveness
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- 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
- Universally Composable Authentication and Key-Exchange with Global PKI
- Adaptive hardness and composable security in the plain model from standard assumptions
- Universally composable security with local adversaries
- Compact and efficient UC commitments under atomic-exchanges
- Distributing the setup in universally composable multi-party computation
- Universal composition with responsive environments
- Bringing people of different beliefs together to do UC
- A second note on the feasibility of generalized universal composability
- 3-message zero knowledge against human ignorance
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Incoercible multi-party computation and universally composable receipt-free voting
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- New notions of security: achieving universal composability without trusted setup
- Long-Term Security and Universal Composability
- Universally Composable Adaptive Oblivious Transfer
- A note on the feasibility of generalised universal composability
- Possibility and impossibility results for selective decommitments
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- How to Build a Hash Function from Any Collision-Resistant Function
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Better two-round adaptive multi-party computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Removing erasures with explainable hash proof systems
- Formal abstractions for attested execution secure processors
- Concurrently composable security with shielded super-polynomial simulators
- Long-term security and universal composability
- Witness-succinct universally-composable SNARKs
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Concurrently composable non-interactive secure computation
- Astrolabous: a universally composable time-lock encryption scheme
- Generalized channels from limited blockchain scripts and adaptor signatures
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Algebraic adversaries in the universal composability framework
- A new approach to efficient non-malleable zero-knowledge
- Universally composable -protocols in the global random-oracle model
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- GUC-secure commitments via random oracles: new impossibility and feasibility
- Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery
- Endemic oblivious transfer via random oracles, revisited
- Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer
- Secure computation without authentication
- On the correlation complexity of MPC with cheater identification
- Eagle: efficient privacy preserving smart contracts
- Taming adaptivity in YOSO protocols: the modular way
- Composable long-term security with rewinding
- Practically efficient private set intersection from trusted hardware with side-channels
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions
- Universally composable transaction order fairness: refined definitions and adaptive security
- Adaptive UC NIZK for practical applications
- Continuous group-key agreement: concurrent updates without pruning
- Universally composable almost-everywhere secure computation
- Proofs of sequential communication delays from physical assumptions and their applications
- Universally composable interactive and ordered multi-signatures
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- zkSNARKs in the ROM with unconditional UC-security
- Composing bridges
- Identity-based trapdoor mercurial commitments and applications
- UC4Free! Existing threshold signatures are UC secure
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)
