Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k

Keyphrases

• Mixed Mode 100%
• Zero-knowledge 100%
• Brie 100%
• Zero-knowledge Proof 100%
• Crypto 50%
• Information Theory 50%
• Truncation 50%
• 64-bit 50%
• 32-bit 50%
• Large Field 50%
• Efficient Representation 50%
• Programming Model 50%
• Cryptographic Protocols 50%
• Commit-and-prove 50%
• Shared Value 50%
• Arithmetic Operations 50%
• Finite Fields 50%
• Interactive Proof Systems 50%
• Consistency Checking 50%
• Inflexibility 50%
• Highly Flexible 50%
• Modular Operation 50%
• Complex Programs 50%
• Knowledge Conversion 50%
• Systems-based 50%
• Oblivious Linear Evaluation 50%
• Zero-knowledge Protocol 50%
• Proof Systems 50%
• Secure System 50%
• Modern Computer Architecture 50%

Computer Science

• Proof System 100%
• Consistency Check 100%
• Programming Model 50%
• Building-Blocks 50%
• Cryptographic Protocol 50%
• Knowledge Protocol 50%
• Computer Architecture 50%
• Interactivity 50%
• Arithmetic Operation 50%