Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead

Keyphrases

• Computation Overhead 100%
• Arithmetic Computation 100%
• Oblivious Linear Evaluation 100%
• Evaluation Protocol 75%
• Black Box 50%
• Long Vector 50%
• High Efficiency 25%
• Linear Codes 25%
• Two-party 25%
• Oblivious Transfer 25%
• Arithmetic Circuits 25%
• Non-malleability 25%
• Round Complexity 25%
• Non-interactive 25%
• Low-degree Polynomials 25%
• Information Theory 25%
• Shortest Vector 25%
• Simple Arithmetic 25%
• Finite Fields 25%
• Conditional Disclosure of Secrets 25%
• Small Fields 25%
• Arithmetic Operations 25%
• New Ingredients 25%
• Secure Protocol 25%
• Efficient Vector 25%
• Crypto 25%
• Cryptographic Assumptions 25%
• Malicious Adversary 25%
• Active Adversary 25%
• Asymptotic Rates 25%
• Amortized Cost 25%
• Prototype Implementation 25%
• Technical Approach 25%
• Fast Networks 25%
• Theoretical Optimization 25%
• Garbled Circuits 25%
• Practical Optimization 25%

Computer Science

• Arithmetic Circuit 100%
• Secure Protocol 100%
• Malicious Adversary 100%
• Degree Polynomial 100%
• Elementary Property 100%
• Arithmetic Operation 100%
• Technical Approach 100%

Mathematics

• Black Box 100%
• Asymptotics 50%
• Linear Code 50%
• Polynomial 50%
• Finite Field 50%
• Conditionals 50%
• Low Degree 50%
• Intractability 50%
• Arithmetic Operation 50%