Universally composable two-party and multi-party secure computation
From MaRDI portal
Recommendations
- General composition and universal composability in secure multiparty computation
- On the limitations of universally composable two-party computation without set-up assumptions
- scientific article; zbMATH DE number 2009949
- Universally Composable Multi-party Computation with an Unreliable Common Reference String
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Cited in
(only showing first 100 items - show all)- A note on universal composable zero-knowledge in the common reference string model
- Analyzing security protocols using time-bounded task-PIOAs
- On the relationships between notions of simulation-based security
- Hybrid commitments and their applications to zero-knowledge proof systems
- General composition and universal composability in secure multiparty computation
- 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
- An improved affine equivalence algorithm for random permutations
- Round-efficient black-box construction of composable multi-party computation
- All-but-many encryption
- On the (im-)possibility of extending coin toss
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- 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
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Round-optimal black-box commit-and-prove with succinct communication
- Two-round oblivious transfer from CDH or LPN
- On the concurrent composition of quantum zero-knowledge
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Signatures of knowledge for Boolean circuits under standard assumptions
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Another look at extraction and randomization of Groth's zk-SNARK
- 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
- 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
- UC priced oblivious transfer with purchase statistics and dynamic pricing
- On the power of secure two-party computation
- On black-box complexity of universally composable security in the CRS model
- Probabilistic termination and composability of cryptographic protocols
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Lower bounds and impossibility results for concurrent self composition
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- On the limitations of universally composable two-party computation without set-up assumptions
- Modular proofs for key exchange: rigorous optimizations in the Canetti-Krawczyk model
- GNUC: a new universal composability framework
- Protocols for multiparty coin toss with a dishonest majority
- A novel quantum anonymous ranking protocol
- 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
- Adaptive security of multi-party protocols, revisited
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Generic construction of UC-secure oblivious transfer
- On the complexity of additively homomorphic UC commitments
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
- Adaptive hardness and composable security in the plain model from standard assumptions
- 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
- 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
- Universally Composable Non-Interactive Key Exchange
- Compact and efficient UC commitments under atomic-exchanges
- Adaptive oblivious transfer and generalization
- Structure-preserving smooth projective hashing
- Universally composable private proximity testing
- A second note on the feasibility of generalized universal composability
- 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
- When is a semi-honest secure multiparty computation valuable?
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- On the necessary and sufficient assumptions for UC computation
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Secure Protocols with Asymmetric Trust
- Universally Composable Undeniable Signature
- Composable Security in the Bounded-Quantum-Storage Model
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
- Universally composable incoercibility
- Perfect Non-interactive Zero Knowledge for NP
- On the (Im-)Possibility of Extending Coin Toss
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
- Universally Composable Adaptive Oblivious Transfer
- Universally Composable Multiparty Computation with Partially Isolated Parties
- Adaptively Secure Two-Party Computation with Erasures
- Local Sequentiality Does Not Help for Concurrent Composition
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- Impossibility results for universal composability in public-key models and with fixed inputs
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Cryptography using \texttt{CAPTCHA} puzzles
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
- A novel protocol for multiparty quantum key management
- Quantum private comparison over noisy channels
- How to simulate it -- a tutorial on the simulation proof technique
This page was built for publication: Universally composable two-party and multi-party secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579187)
