Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings

DOI10.1007/978-3-030-75245-3_24zbMath1479.94154OpenAlexW3162638080MaRDI QIDQ2061939

Yanyan Li

Publication date: 21 December 2021

Full work available at URL: https://hal.inria.fr/hal-03381386/file/TPKE-DCR.pdf

zbMATH Keywords

standard modeladaptive securitychosen-ciphertext securitythreshold cryptography\(\mathsf{LWE}\)\(\mathsf{DCR}\)non-interactive schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Securing threshold cryptosystems against chosen ciphertext attack
• Adaptively secure distributed PRFs from LWE
• Threshold cryptosystems from threshold fully homomorphic encryption
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
• Two-sided malicious security for private intersection-sum with cardinality
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• How to share a function securely
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Key Homomorphic PRFs and Their Applications
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
• On the Non-malleability of the Fiat-Shamir Transform
• Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Circular and KDM Security for Identity-Based Encryption
• Fully Leakage-Resilient Signatures
• Decentralizing Attribute-Based Encryption
• Threshold and Revocation Cryptosystems via Extractable Hash Proofs
• Adaptively Secure Non-interactive Threshold Cryptosystems
• Efficient Threshold Encryption from Lossy Trapdoor Functions
• Short monotone formulae for the majority function
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Trapdoors for hard lattices and new cryptographic constructions
• Simplified Threshold RSA with Adaptive and Proactive Security
• Monotone Circuits for the Majority Function
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Securing threshold cryptosystems against chosen ciphertext attack
• An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
• On (Valiant’s) Polynomial-Size Monotone Formula for Majority
• Fully homomorphic encryption using ideal lattices
• Fiat-Shamir: from practice to theory
• How to withstand mobile virus attacks (extended abstract)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
• Advances in Cryptology - CRYPTO 2003
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2006
• Public Key Cryptography - PKC 2006
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings