Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
From MaRDI portal
Cites work
- A new polynomial factorization algorithm and its implementation
- Accountability for misbehavior in threshold decryption via threshold traitor tracing
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- An improved threshold homomorphic cryptosystem based on class groups
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compact zero-knowledge proofs of small Hamming weight
- Composition of secure multi-party protocols. A comprehensive study.
- Computing isomorphisms and embeddings of finite fields
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Fast Algorithms for Manipulating Formal Power Series
- Fast arithmetic for the algebraic closure of finite fields
- Fast construction of irreducible polynomials over finite fields
- Fast secure computations on shared polynomials and applications to private set operations
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- How to share a function securely
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1023994 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2009959 (Why is no real title available?)
- scientific article; zbMATH DE number 2081074 (Why is no real title available?)
- scientific article; zbMATH DE number 2081075 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- scientific article; zbMATH DE number 1406778 (Why is no real title available?)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Public Key Cryptography - PKC 2006
- Robust and efficient sharing of RSA functions.
- Secure distributed key generation for discrete-log based cryptosystems
- Securing threshold cryptosystems against chosen ciphertext attack
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The algebraic decoding of Goppa codes
- The return of the SDitH
- Theory of Cryptography
- Theory of Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Tighter proofs of CCA security in the quantum random oracle model
This page was built for publication: Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844122)
