Collaborative, privacy-preserving data aggregation at scale
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Semi-homomorphic encryption and multiparty computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Generic fully simulatable adaptive oblivious transfer
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Efficiency limitations for Σ-protocols for group homomorphisms
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient RSA key generation and threshold paillier in the two-party setting
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Revocable identity-based encryption from lattices
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
On the amortized complexity of zero knowledge protocols for multiplicative relations
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Zero-Knowledge proofs with low amortized communication from lattice assumptions
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Efficiency limitations of Σ-protocols for group homomorphisms revisited
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Efficient integer span program for hierarchical threshold access structure
Information Processing Letters
| Hi-index | 0.00 |
We propose a general technique that allows improving the complexity of zero-knowledge protocols for a large class of problems where previously the best known solution was a simple cut-and-choose style protocol, i.e., where the size of a proof for problem instance x and error probability 2驴 n was O(|x| n) bits. By using our technique to prove n instances simultaneously, we can bring down the proof size per instance to O(|x| + n) bits for the same error probability while using no computational assumptions. Examples where our technique applies include proofs for quadratic residuosity, proofs of subgroup membership and knowledge of discrete logarithms in groups of unknown order, and proofs of plaintext knowledge for various types of homomorphic encryptions schemes. The generality of our method stems from a somewhat surprising application of black-box secret sharing schemes.