Generalizing efficient multiparty computation

DOI10.1007/978-3-319-17470-9_2zbMATH Open1336.94042OpenAlexW280815280MaRDI QIDQ2947520FDOQ2947520

Authors: Bernardo David, Ryo Nishimaki, Samuel Ranellucci, 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

Recommendations

• Topics in Cryptology – CT-RSA 2006
• On cut-and-choose oblivious transfer and its variants
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation via cut-and-choose oblivious transfer

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Cites Work

• Efficient public-key cryptography in the presence of key leakage
• Secure two-party computation via cut-and-choose oblivious transfer
• Efficient Two-Party Secure Computation on Committed Inputs
• A Framework for Efficient and Composable Oblivious Transfer
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Secure two-party computation via cut-and-choose oblivious transfer
• Structure preserving CCA secure encryption and applications
• Structure-preserving signatures and commitments to group elements
• Founding Cryptography on Oblivious Transfer – Efficiently
• Title not available (Why is that?)
• Title not available (Why is that?)
• The IPS compiler: optimizations, variants and concrete efficiency
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• P-signatures and Noninteractive Anonymous Credentials
• Alternative Protocols for Generalized Oblivious Transfer
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Generalized oblivious transfer by secret sharing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Groth–Sahai Proofs Revisited

Cited In (14)

• TinyKeys: a new approach to efficient multi-party computation
• Communication Locality in Secure Multi-party Computation
• Collusion-Free Multiparty Computation in the Mediated Model
• Efficient information-theoretic multi-party computation over non-commutative rings
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Faster secure two-party computation in the single-execution setting
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Preface (to the special issue on general secure multiparty computation)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Realizable Rational Multiparty Cryptographic Protocols
• A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
• General composition and universal composability in secure multiparty computation
• Title not available (Why is that?)

This page was built for publication: Generalizing efficient multiparty computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947520)