Pages that link to "Item:Q1976007"
From MaRDI portal
The following pages link to Security and composition of multiparty cryptographic protocols (Q1976007):
Displaying 50 items.
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Making \textit{any} attribute-based encryption accountable, efficiently (Q2167762) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Server-aided private set intersection based on reputation (Q2293036) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- A novel quantum anonymous ranking protocol (Q2685654) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Simplified Universal Composability Framework (Q2796143) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Realizable Rational Multiparty Cryptographic Protocols (Q2818052) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function (Q2942846) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
