Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions

DOI10.1007/s00145-020-09350-3zbMath1453.94097OpenAlexW3034287952MaRDI QIDQ2210433

Publication date: 6 November 2020

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-03116642/file/threshold-framework-journal-version-revision-2.pdf

zbMATH Keywords

robustness public-key encryption non-interactivity chosen-ciphertext security threshold cryptography adaptive corruptions

Mathematics Subject Classification ID

Cryptography (94A60)

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
Efficient hybrid encryption from ID-based encryption
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
Relatively-Sound NIZKs and Password-Based Key-Exchange
Tightly Secure Signatures and Public-Key Encryption
Disjunctions for Hash Proof Systems: New Constructions and Applications
Quasi-Adaptive NIZK for Linear Subspaces Revisited
Identity-Based Cryptosystems and Signature Schemes
Signatures Resilient to Continual Leakage on Memory and Computation
Round-Optimal Password-Based Authenticated Key Exchange
Threshold and Revocation Cryptosystems via Extractable Hash Proofs
Adaptively Secure Non-interactive Threshold Cryptosystems
Structure Preserving CCA Secure Encryption and Applications
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
The Group of Signed Quadratic Residues and Applications
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Batch Groth–Sahai
Structure-Preserving Signatures and Commitments to Group Elements
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
Perfect Non-interactive Zero Knowledge for NP
Simplified Threshold RSA with Adaptive and Proactive Security
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
A New Randomness Extraction Paradigm for Hybrid Encryption
Securing threshold cryptosystems against chosen ciphertext attack
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
A Pseudorandom Generator from any One-way Function
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
Identity-Based Encryption from the Weil Pairing
Tagged One-Time Signatures: Tight Security and Optimal Tag Size
How to withstand mobile virus attacks (extended abstract)
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology – CRYPTO 2004
Advances in Cryptology – CRYPTO 2004
Efficient Identity-Based Encryption Without Random Oracles
Fully Anonymous Group Signatures Without Random Oracles
Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
Efficient Non-interactive Proof Systems for Bilinear Groups
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Theory of Cryptography
Theory of Cryptography
Theory of Cryptography
Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
Theory of Cryptography
Topics in Cryptology – CT-RSA 2006
Theory of Cryptography

This page was built for publication: Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions