Improved non-interactive zero knowledge with applications to post-quantum signatures
Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …
{ZKBoo}: Faster {Zero-Knowledge} for Boolean Circuits
I Giacomelli, J Madsen, C Orlandi - 25th usenix security symposium …, 2016 - usenix.org
In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge
arguments especially tailored for Boolean circuits and report on a proof-ofconcept …
arguments especially tailored for Boolean circuits and report on a proof-ofconcept …
Stacked garbling for disjunctive zero-knowledge proofs
D Heath, V Kolesnikov - Annual International Conference on the Theory …, 2020 - Springer
Abstract Zero-knowledge (ZK) proofs (ZKP) have received wide attention, focusing on non-
interactivity, short proof size, and fast verification time. We focus on the fastest total proof …
interactivity, short proof size, and fast verification time. We focus on the fastest total proof …
Encryption switching protocols
We formally define the primitive of encryption switching protocol (ESP), allowing to switch
between two encryption schemes. Intuitively, this two-party protocol converts given …
between two encryption schemes. Intuitively, this two-party protocol converts given …
[PDF][PDF] New applications of secret-sharing in cryptography
I Giacomelli - 2017 - pure.au.dk
Secret-sharing schemes were introduced in 1979 to implement a specific practical task (ie
secure data storage). However, later on they have found applications as a building block in …
secure data storage). However, later on they have found applications as a building block in …