Topics in Cryptology – CT-RSA 2006
From MaRDI portal
Publication:5898566
DOI10.1007/11605805zbMATH Open1125.94012DBLPconf/ctrsa/2006OpenAlexW2564556261MaRDI QIDQ5898566FDOQ5898566
Authors: Dan Boneh, Xavier Boyen, Shai Halevi 
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
Recommendations
- Chosen-Ciphertext Secure Threshold Identity-Based Key Encapsulation Without Random Oracles
- Chosen Ciphertext Secure Certificateless Threshold Encryption in the Standard Model
- Certificateless threshold cryptosystem secure against chosen-ciphertext attack
- Secure public-key encryption scheme without random oracles
- Chosen-ciphertext security without redundancy
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- scientific article; zbMATH DE number 2081075
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Threshold public key encryption scheme resilient against continual leakage without random oracles
Cited In (40)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Efficient hybrid encryption from ID-based encryption
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- Identity-based threshold decryption on access structure
- Chosen-Ciphertext Secure Threshold Identity-Based Key Encapsulation Without Random Oracles
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Efficient selective identity-based encryption without random oracles
- Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency
- Signcryption schemes with threshold unsigncryption, and applications
- Extensions of access structures and their cryptographic applications
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Multi-recipient and threshold encryption based on hidden multipliers
- Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Practical Threshold Signatures Without Random Oracles
- Homomorphic encryption systems statement: trends and challenges
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Simplified Submission of Inputs to Protocols
- Securing threshold cryptosystems against chosen ciphertext attack
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Dynamic threshold public-key encryption with decryption consistency from static assumptions
- Efficient threshold encryption from lossy trapdoor functions
- Adaptively secure non-interactive threshold cryptosystems
- Multi-rate threshold FlipThem
- Adaptively secure threshold symmetric-key encryption
- Group signatures with decentralized tracing
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism
- Secure public-key encryption scheme without random oracles
- Accountability for misbehavior in threshold decryption via threshold traitor tracing
- Threshold encryption with silent setup
- Timed-release computational secret sharing and threshold encryption
- All-in-one group-oriented cryptosystem based on bilinear pairing
- Efficient dynamic threshold identity-based encryption with constant-size ciphertext
- Threshold public key encryption scheme resilient against continual leakage without random oracles
- Tag-KEM/DEM: A new framework for hybrid encryption
- CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts
- Fully secure threshold unsigncryption
- Efficient identity-based threshold decryption scheme from bilinear pairings
- Construction of Threshold (Hybrid) Encryption in the Random Oracle Model: How to Construct Secure Threshold Tag-KEM from Weakly Secure Threshold KEM
This page was built for publication: Topics in Cryptology – CT-RSA 2006
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898566)
