Generalizing efficient multiparty computation

DOI10.1007/978-3-319-17470-9_2MaRDI QIDQ2947520zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• scientific article; zbMATH DE number 1759773 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• Alternative Protocols for Generalized Oblivious Transfer
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Two-Party Secure Computation on Committed Inputs
• Efficient public-key cryptography in the presence of key leakage
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Founding Cryptography on Oblivious Transfer – Efficiently
• Generalized oblivious transfer by secret sharing
• Groth–Sahai Proofs Revisited
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• P-signatures and Noninteractive Anonymous Credentials
• Secure two-party computation via cut-and-choose oblivious transfer
• 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
• The IPS compiler: optimizations, variants and concrete efficiency
• Universally Composable Adaptive Oblivious Transfer

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
• Preface (to the special issue on general secure multiparty computation)
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• 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
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)

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)