Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography

DOI10.1007/978-3-662-49096-9_11zbMath1348.94055OpenAlexW2296006817MaRDI QIDQ2796128

Dennis Hofheinz

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_11

zbMATH Keywords

digital signaturespublic-key encryptiontight security proofspartitioning arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Optimal tightness for chain-based unique signatures ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting ⋮ Asymmetric group message franking: definitions and constructions ⋮ Generalized public-key cryptography with tight security ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Compact structure-preserving signatures with almost tight security ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Adaptive Partitioning ⋮ Short identity-based signatures with tight security from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• All-But-Many Lossy Trapdoor Functions
• Optimal Security Proofs for Full Domain Hash, Revisited
• Tightly Secure Signatures and Public-Key Encryption
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Tight Proofs for Signature Schemes without Random Oracles
• Commuting Signatures and Verifiable Encryption
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Short and Stateless Signatures from the RSA Assumption
• Easy Verifiable Primitives and Practical Public Key Cryptosystems
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Bonsai Trees, or How to Delegate a Lattice Basis
• Structure-Preserving Signatures and Commitments to Group Elements
• Practical Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Polynomially Many Levels
• Strengthening Security of RSA-OAEP
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Identity-Based Encryption from the Weil Pairing
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• A Practical and Tightly Secure Signature Scheme Without Hash Function
• Fine-Tuning Groth-Sahai Proofs
• Proving Tight Security for Rabin-Williams Signatures
• The Twin Diffie-Hellman Problem and Applications

This page was built for publication: Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography