Blind polynomial evaluation and data trading

DOI10.1007/978-3-030-78372-3_5zbMath1489.68086OpenAlexW3126461432MaRDI QIDQ2117031

Yanyan Li

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_5

zbMATH Keywords

ElGamal encryptionblockchainPaillier encryptionblind polynomial evaluationencryption-switching protocol

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Count me in! Extendability for threshold ring signatures

Uses Software

• NTL
• PrivateLR

Cites Work

• Unnamed Item
• Encryption switching protocols revisited: switching modulo \(p\)
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• Valiant's universal circuits revisited: an overall improvement and a lower bound
• Encryption Switching Protocols
• Oblivious evaluation of multivariate polynomials
• How to Use Bitcoin to Design Fair Protocols
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Universal circuits (Preliminary Report)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• Oblivious Polynomial Evaluation
• Modeling Bitcoin Contracts by Timed Automata
• Differential Privacy

This page was built for publication: Blind polynomial evaluation and data trading