Securing threshold cryptosystems against chosen ciphertext attack

DOI10.1007/BFB0054113zbMath0919.94031MaRDI QIDQ4249624

Rosario Gennaro, Victor Shoup

Publication date: 9 September 1999

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

threshold cryptosystemsciphertext attackrandom hash function model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (34)

Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability ⋮ Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency ⋮ Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption ⋮ Protecting the privacy of voters: new definitions of ballot secrecy for e-voting ⋮ Parameter-hiding order revealing encryption ⋮ On ASGS framework: general requirements and an example of implementation ⋮ Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Distributed certificateless key encapsulation mechanism secure against the adaptive adversary ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Identity-based threshold decryption on access structure ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Timed-release computational secret sharing and threshold encryption ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Better than advertised security for non-interactive threshold signatures ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Simplified Submission of Inputs to Protocols ⋮ Certificateless threshold cryptosystem secure against chosen-ciphertext attack ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Verifiable Elections That Scale for Free ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism ⋮ Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model) ⋮ Protecting against key-exposure: strongly key-insulated encryption with optimal threshold ⋮ Fair Traceable Multi-Group Signatures ⋮ Fast secure two-party ECDSA signing ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Bandwidth-efficient threshold EC-DSA ⋮ An efficient certificateless multi-receiver threshold decryption scheme ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ Cryptographic Voting — A Gentle Introduction ⋮ Adaptively secure distributed public-key systems.

This page was built for publication: Securing threshold cryptosystems against chosen ciphertext attack