Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-11799-2_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Super-Perfect Zero-Knowledge Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

English

General Properties of Quantum Zero-Knowledge Proofs

English

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Multi-Bit Cryptosystems Based on Lattice Problems

English

On the Concrete Complexity of Zero-Knowledge Proofs

English

Efficient Certification and Zero-Knowledge Proofs of Knowledge on Infrastructure Topology Graphs

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy