Actively secure arithmetic computation and VOLE with constant computational overhead

DOI10.1007/978-3-031-30617-4_7OpenAlexW4365807769MaRDI QIDQ6061358

Niv Konstantini, Benny Applebaum

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_7

zbMATH Keywords

cryptographic protocolssecure computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptographic hardness of random local functions. Survey
• Generalized oblivious transfer by secret sharing
• On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
• Composition of secure multi-party protocols. A comprehensive study.
• Secure arithmetic computation with constant computational overhead
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• An algebraic approach to maliciously secure private set intersection
• Reusable non-interactive secure computation
• Maliciously secure oblivious linear function evaluation with constant overhead
• Oblivious transfer and polynomial evaluation
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Information-Theoretically Secure Protocols and Security under Composition
• Inter-reciprocity applied to electrical networks
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Arithmetic Cryptography
• Circuits resilient to additive attacks with applications to secure computation
• Algebraic attacks against random local functions and their countermeasures
• Advances in Cryptology - CRYPTO 2003
• Alternative Protocols for Generalized Oblivious Transfer
• How to Garble Arithmetic Circuits
• Theory of Cryptography
• Cryptography in $NC^0$

This page was built for publication: Actively secure arithmetic computation and VOLE with constant computational overhead