Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
From MaRDI portal
Publication:2210433
Recommendations
- Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure forward-secure non-interactive threshold cryptosystems
- scientific article; zbMATH DE number 1418290
- scientific article; zbMATH DE number 2081074
- scientific article; zbMATH DE number 5009201
- Towards tight adaptive security of non-interactive key exchange
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
Cites work
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A Pseudorandom Generator from any One-way Function
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure threshold signature scheme in the standard model
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack
- Batch Groth-Sahai
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient chosen-ciphertext security via extractable hash proofs
- Efficient hybrid encryption from ID-based encryption
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Extended tower number field sieve: a new complexity for the medium prime case
- Fully Anonymous Group Signatures Without Random Oracles
- How to withstand mobile virus attacks (extended abstract)
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 2081075 (Why is no real title available?)
- scientific article; zbMATH DE number 1504548 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1405784 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- scientific article; zbMATH DE number 1418292 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-Based Encryption from the Weil Pairing
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- Perfect Non-interactive Zero Knowledge for NP
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- Quasi-adaptive NIZK for linear subspaces revisited
- Relatively-Sound NIZKs and Password-Based Key-Exchange
- Round-optimal password-based authenticated key exchange
- Securing threshold cryptosystems against chosen ciphertext attack
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Signatures resilient to continual leakage on memory and computation
- Simplified Threshold RSA with Adaptive and Proactive Security
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure preserving CCA secure encryption and applications
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Structure-preserving signatures and commitments to group elements
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- Tagged one-time signatures: tight security and optimal tag size
- The Group of Signed Quadratic Residues and Applications
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Threshold and revocation cryptosystems via extractable hash proofs
- Tightly Secure Signatures and Public-Key Encryption
- Topics in Cryptology – CT-RSA 2006
Cited in
(8)- Adaptively secure non-interactive threshold cryptosystems
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
- Adaptively secure non-interactive threshold cryptosystems
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- Adaptively secure forward-secure non-interactive threshold cryptosystems
- Advances in Cryptology – CRYPTO 2004
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
This page was built for publication: Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210433)
