Concise multi-challenge CCA-secure encryption and signatures with almost tight security

DOI10.1007/978-3-662-45608-8_1zbMATH Open1311.94107OpenAlexW2293212293MaRDI QIDQ2936596FDOQ2936596

Authors:

Publication date: 6 January 2015

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

Full work available at URL: https://hal.inria.fr/hal-01088108/file/tightness-AC14.pdf

Recommendations

• Tightly Secure Signatures and Public-Key Encryption
• Tightly secure signatures and public-key encryption
• Tightly-secure encryption in the multi-user, multi-challenge setting with improved efficiency
• Tightly CCA-secure encryption without pairings
• Adaptive partitioning

zbMATH Keywords

efficiencysignaturemulti-usermulti-challengetight securityCCA-secure encryptionIND-CCA2 securityQA-NIZK proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (28)

• Tightly-secure encryption in the multi-user, multi-challenge setting with improved efficiency
• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Memory-tight multi-challenge security of public-key encryption
• Miniature CCA2 PK Encryption: Tight Security Without Redundancy
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• CCA-Secure and Revocable Certificateless Encryption with Ciphertext Evolution
• Parallel-CFS
• Tightly secure signatures and public-key encryption
• Parameter-hiding order revealing encryption
• Rerandomizable signatures under standard assumption
• Short tightly secure signatures for signing a vector of group elements: a new approach
• Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
• Fine-grained verifier NIZK and its applications
• Kurosawa-Desmedt meets tight security
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Linearly homomorphic structure-preserving signatures and their applications
• Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
• Adaptive partitioning
• Tightly secure ring signatures in the standard model
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• Optimal tightness for chain-based unique signatures
• Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
• Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
• Compact structure-preserving signatures with almost tight security
• Generalized public-key cryptography with tight security
• Tightly CCA-secure encryption without pairings
• On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness

This page was built for publication: Concise multi-challenge CCA-secure encryption and signatures with almost tight security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936596)