Encoding functions with constant online rate, or how to compress garbled circuit keys

Computer Science

• Online Communication 100%
• Online Computation 100%
• encryption key 100%
• Security Parameter 100%
• Encoding Function 100%
• Arithmetic Operation 50%
• Polynomial Time 50%
• Communication Complexity 50%
• secure multiparty computation 50%
• Knowledge Proof 50%
• Diffie-Hellman-Merkle key exchange 50%
• Learning with Errors 50%
• Time Computable Function 50%
• Complex Function 50%

Keyphrases

• Compress 100%
• Random Phase Encoding 100%
• Garbled Circuits 100%
• Online Communication 40%
• Online Computation 40%
• Encryption Key 40%
• Security Parameters 40%
• Arithmetic Operations 20%
• Polynomial Time 20%
• Complex Function 20%
• Communication Complexity 20%
• Non-interactive 20%
• Arithmetic Formulas 20%
• Bitstring 20%
• Prover 20%
• Computable Function 20%
• Secure multi-party Computation 20%
• Zero-knowledge Proof 20%
• Efficiency Improvement 20%
• Output Distribution 20%
• Circuit Construction 20%
• Yao's Garbled Circuits 20%
• Learning with Errors Problem 20%
• Short String 20%
• Verifiable Computation 20%
• Computational Diffie-Hellman Assumption 20%
• RSA Assumption 20%
• Preprocessing Model 20%
• Concrete Application 20%