An improvement of multi-exponentiation with encrypted bases argument: smaller and faster

DOI10.1007/978-3-030-71852-7_27zbMath1479.94224OpenAlexW3023874811MaRDI QIDQ2057167

Yanyan Li

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_27

zbMATH Keywords

zero-knowledgePaillier encryptionencryption switching protocolstwin-ciphertext proof

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Blind polynomial evaluation and data trading

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A verifiable secret shuffle of homomorphic encryptions
• Efficient secure two-party protocols. Techniques and constructions
• Probabilistic encryption
• Parallel coin-tossing and constant-round secure two-party computation
• Encryption switching protocols revisited: switching modulo \(p\)
• Encryption Switching Protocols
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices

This page was built for publication: An improvement of multi-exponentiation with encrypted bases argument: smaller and faster