Universally composable two-party and multi-party secure computation
From MaRDI portal
Publication:3579187
DOI10.1145/509907.509980zbMath1192.94112OpenAlexW2113085788MaRDI QIDQ3579187
Rafail Ostrovsky, Amit Sahai, Yehuda Lindell, Ran Canetti
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509980
Related Items
On the concurrent composition of quantum zero-knowledge, Two-round adaptively secure multiparty computation from standard assumptions, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Round optimal black-box ``commit-and-prove, Constant-round leakage-resilient zero-knowledge from collision resistance, Signatures of Knowledge for Boolean Circuits Under Standard Assumptions, Signatures of knowledge for Boolean circuits under standard assumptions, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, Cross and Clean: Amortized Garbled Circuits with Constant Overhead, UC-secure and Contributory Password-Authenticated Group Key Exchange, Zero-knowledge proofs for set membership: efficient, succinct, modular, Another look at extraction and randomization of Groth's zk-SNARK, A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer, Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs, On black-box extension of a non-interactive zero-knowledge proof system for secret equality, Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument, An improved affine equivalence algorithm for random permutations, Everlasting UC commitments from fully malicious PUFs, Universally composable subversion-resilient cryptography, Practical non-interactive publicly verifiable secret sharing with thousands of parties, Adaptively secure computation for RAM programs, Long-term security and universal composability, UC priced oblivious transfer with purchase statistics and dynamic pricing, Compact and Efficient UC Commitments Under Atomic-Exchanges, Secure Protocols with Asymmetric Trust, Adaptive Oblivious Transfer and Generalization, Structure-Preserving Smooth Projective Hashing, (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens, Lower bounds and impossibility results for concurrent self composition, A novel quantum anonymous ranking protocol, Constant-round adaptive zero-knowledge proofs for NP, Efficient and round-optimal oblivious transfer and commitment with adaptive security, Non-committing encryption with constant ciphertext expansion from standard assumptions, Practical exact proofs from lattices: new techniques to exploit fully-splitting rings, Universally Composable Undeniable Signature, Composable Security in the Bounded-Quantum-Storage Model, Adaptive security of multi-party protocols, revisited, Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions, Impossibility results for universal composability in public-key models and with fixed inputs, Round-efficient black-box construction of composable multi-party computation, A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort, Resource fairness and composability of cryptographic protocols, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, Secure computation without authentication, Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons, When Is a Semi-honest Secure Multiparty Computation Valuable?, A novel protocol for multiparty quantum key management, Quantum private comparison over noisy channels, The reactive simulatability (RSIM) framework for asynchronous systems, All-but-many encryption, A full proof of the BGW protocol for perfectly secure multiparty computation, Efficient one-sided adaptively secure computation, On the (im-)possibility of extending coin toss, Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption, Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS, Cryptography Using Captcha Puzzles, Unifying simulatability definitions in cryptographic systems under different timing assumptions, Perfect Non-interactive Zero Knowledge for NP, On the (Im-)Possibility of Extending Coin Toss, Universally Composable Adaptive Oblivious Transfer, Modular proofs for key exchange: rigorous optimizations in the Canetti-Krawczyk model, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Generic Construction of UC-Secure Oblivious Transfer, On the Complexity of Additively Homomorphic UC Commitments, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, GNUC: a new universal composability framework, Protocols for multiparty coin toss with a dishonest majority, A note on universal composable zero-knowledge in the common reference string model, Adaptively Secure Two-Party Computation with Erasures, Local Sequentiality Does Not Help for Concurrent Composition, Cryptography in the multi-string model, On the power of secure two-party computation, Topology-hiding computation for networks with unknown delays, Function secret sharing for mixed-mode and fixed-point secure computation, Towards accountability in CRS generation, Abuse resistant law enforcement access systems, Analyzing security protocols using time-bounded task-PIOAs, On the relationships between notions of simulation-based security, Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Universally Composable Private Proximity Testing, Hybrid commitments and their applications to zero-knowledge proof systems, Shorter lattice-based zero-knowledge proofs via one-time commitments, On Adaptively Secure Multiparty Computation with a Short CRS, Improving Practical UC-Secure Commitments Based on the DDH Assumption, A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation, General composition and universal composability in secure multiparty computation, On the Power of Secure Two-Party Computation, Rate-1, Linear Time and Additively Homomorphic UC Commitments, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, Probabilistic Termination and Composability of Cryptographic Protocols, On black-box complexity of universally composable security in the CRS model, Probabilistic termination and composability of cryptographic protocols, On the Necessary and Sufficient Assumptions for UC Computation, Round-optimal black-box commit-and-prove with succinct communication, A second note on the feasibility of generalized universal composability, How to Simulate It – A Tutorial on the Simulation Proof Technique, Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model, Initiator-Resilient Universally Composable Key Exchange, Two-round oblivious transfer from CDH or LPN, Witness-succinct universally-composable SNARKs, Round-optimal oblivious transfer and MPC from computational CSIDH, A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure), PAPR: publicly auditable privacy revocation for anonymous credentials, Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general, Triply adaptive UC NIZK, Two-round adaptively secure MPC from isogenies, LPN, or CDH, A new approach to efficient non-malleable zero-knowledge, Endemic oblivious transfer via random oracles, revisited, Completeness theorems for adaptively secure broadcast, On concurrent multi-party quantum computation, Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs, Cryptography and cryptographic protocols, An Algebraic Approach to Nonmalleability, Efficient non-malleable commitment schemes, 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, Concurrently Composable Security with Shielded Super-Polynomial Simulators, Magic Adversaries Versus Individual Reduction: Science Wins Either Way, Efficient non-malleable commitment schemes, Zero-knowledge proofs for set membership: efficient, succinct, modular, Equivocal Blind Signatures and Adaptive UC-Security, From fairness to full security in multiparty computation, Multi-theorem preprocessing NIZKs from lattices, Secure computation of the median (and other elements of specified ranks), David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware, Adaptively secure MPC with sublinear communication complexity, Universally Composable Security Analysis of TLS, Round Optimal Universally Composable Oblivious Transfer Protocols, Multiparty generation of an RSA modulus, Conditional Reactive Simulatability
