Topics in Cryptology – CT-RSA 2006

DOI10.1007/11605805zbMath1125.94012DBLPconf/ctrsa/2006OpenAlexW2564556261WikidataQ56921257 ScholiaQ56921257MaRDI QIDQ5898566

Shai Halevi, Xavier Boyen, Dan Boneh

Publication date: 12 February 2007

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

Full work available at URL: https://doi.org/10.1007/11605805

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (31)

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 ⋮ Group Signatures with Decentralized Tracing ⋮ Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions ⋮ Multi-rate threshold FlipThem ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Threshold public key encryption scheme resilient against continual leakage without random oracles ⋮ Identity-based threshold decryption on access structure ⋮ CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts ⋮ Practical Threshold Signatures Without Random Oracles ⋮ Timed-release computational secret sharing and threshold encryption ⋮ Encapsulated search index: public-key, sub-linear, distributed, and delegatable ⋮ Efficient dynamic threshold identity-based encryption with constant-size ciphertext ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ Signcryption schemes with threshold unsigncryption, and applications ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Efficient identity-based threshold decryption scheme from bilinear pairings ⋮ Simplified Submission of Inputs to Protocols ⋮ Efficient selective identity-based encryption without random oracles ⋮ All-in-one group-oriented cryptosystem based on bilinear pairing ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Fully Secure Threshold Unsigncryption ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Homomorphic encryption systems statement: trends and challenges ⋮ Extensions of access structures and their cryptographic applications ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions

This page was built for publication: Topics in Cryptology – CT-RSA 2006