Generalizing Efficient Multiparty Computation
From MaRDI portal
Publication:2947520
DOI10.1007/978-3-319-17470-9_2zbMath1336.94042OpenAlexW280815280MaRDI QIDQ2947520
Ryo Nishimaki, Samuel Ranellucci, Bernardo David, Alain Tapp
Publication date: 24 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_2
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting
Cites Work
- Generalized oblivious transfer by secret sharing
- Secure two-party computation via cut-and-choose oblivious transfer
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Structure Preserving CCA Secure Encryption and Applications
- Groth–Sahai Proofs Revisited
- Structure-Preserving Signatures and Commitments to Group Elements
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Universally Composable Adaptive Oblivious Transfer
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Efficient Two-Party Secure Computation on Committed Inputs
- P-signatures and Noninteractive Anonymous Credentials
- Alternative Protocols for Generalized Oblivious Transfer
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalizing Efficient Multiparty Computation
