Rerandomizable signatures under standard assumption

DOI10.1007/978-3-030-35423-7_3zbMath1456.94061OpenAlexW2982402501MaRDI QIDQ2179379

R. Kabaleeshwaran, Sanjit Chatterjee

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_3

zbMATH Keywords

dual pairing vector spacesstandard assumptiondual-form signaturesrerandomizable signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Rerandomizable signatures under standard assumption ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

Cites Work

• Pairings for cryptographers
• Towards static assumption based cryptosystem in pairing setting: further applications of DéjàQ and dual-form signature (extended abstract)
• Unbounded ABE via bilinear entropy expansion, revisited
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Rerandomizable signatures under standard assumption
• Reassessing security of randomizable signatures
• Short Randomizable Signatures
• Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
• Semi-adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Divisible E-Cash Made Practical
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
• Constant-Size Dynamic k-TAA
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
• Get Shorty via Group Signatures without Encryption
• Security Analysis of the Strong Diffie-Hellman Problem
• Homomorphic Encryption and Signatures from Vector Decomposition
• Dual Form Signatures: An Approach for Proving Security from Static Assumptions
• Shorter IBE and Signatures via Asymmetric Pairings
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Déjà Q: Using Dual Systems to Revisit q-Type Assumptions

This page was built for publication: Rerandomizable signatures under standard assumption