Adaptive Partitioning

DOI10.1007/978-3-319-56617-7_17zbMath1390.94841OpenAlexW4254600874MaRDI QIDQ5270372

Dennis Hofheinz

Publication date: 23 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_17

zbMATH Keywords

public-key encryptiontight security proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Asymmetric group message franking: definitions and constructions ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Tightly secure ring signatures in the standard model ⋮ Compact structure-preserving signatures with almost tight security ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach

Cites Work

• Unnamed Item
• Unnamed Item
• Stronger security proofs for RSA and Rabin bits.
• Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
• Extended Nested Dual System Groups, Revisited
• A Framework for Identity-Based Encryption with Almost Tight Security
• Compactly Hiding Linear Spans
• Tightly CCA-Secure Encryption Without Pairings
• An Algebraic Framework for Diffie-Hellman Assumptions
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Extended-DDH and Lossy Trapdoor Functions
• Tightly Secure Signatures and Public-Key Encryption
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Number-theoretic constructions of efficient pseudo-random functions
• The Group of Signed Quadratic Residues and Applications
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Adaptive Partitioning