Tagged One-Time Signatures: Tight Security and Optimal Tag Size

DOI10.1007/978-3-642-36362-7_20zbMath1314.94099OpenAlexW125097325MaRDI QIDQ4916017

Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo, Masayuki Abe

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/55343338/Tagged_One_Time_Signatures.pdf

zbMATH Keywords

structure-preserving signaturestagged one-time signaturestight security reductiondecision linear assumption

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (28)

Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Structure-preserving signatures and commitments to group elements ⋮ Tightly secure signatures and public-key encryption ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Issuer-hiding attribute-based credentials ⋮ More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones ⋮ Fine-grained verifier NIZK and its applications ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ On the tightness of forward-secure signature reductions ⋮ Generalized public-key cryptography with tight security ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Tightly secure ring signatures in the standard model ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Adaptive Partitioning ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

Cites Work

• Unnamed Item
• Pairings for cryptographers
• Malleable Proof Systems and Applications
• Group to Group Commitments Do Not Shrink
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
• Tightly Secure Signatures and Public-Key Encryption
• Practical Adaptive Oblivious Transfer from Simple Assumptions
• Efficient Public-Key Cryptography in the Presence of Key Leakage
• Structure Preserving CCA Secure Encryption and Applications
• Randomizable Proofs and Delegatable Anonymous Credentials
• Anonymous Proxy Signatures
• Structure-Preserving Signatures and Commitments to Group Elements
• Universally Composable Adaptive Oblivious Transfer
• Secure Hybrid Encryption from Weakened Key Encapsulation
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• Group Encryption: Non-interactive Realization in the Standard Model
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Fully Anonymous Group Signatures Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

This page was built for publication: Tagged One-Time Signatures: Tight Security and Optimal Tag Size