Compact structure-preserving signatures with almost tight security

Cites Work

Unnamed Item
Advances in cryptology -- ASIACRYPT 2015. 21st international conference on the theory and application of cryptology and information security, Auckland, New Zealand, November 29 -- December 3, 2015. Proceedings. Part I
Structure-preserving signatures and commitments to group elements
Tightly secure signatures and public-key encryption
Constant-size structure-preserving signatures: generic constructions and simple assumptions
Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
More efficient (almost) tightly secure structure-preserving signatures
Compact structure-preserving signatures with almost tight security
Improved (almost) tightly-secure structure-preserving signatures
Updating key size estimations for pairings
Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Shorter QA-NIZK and SPS with tighter security
Another look at tightness. II: Practical issues in cryptography
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
A Framework for Identity-Based Encryption with Almost Tight Security
Compactly Hiding Linear Spans
Tightly CCA-Secure Encryption Without Pairings
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
Fully, (Almost) Tightly Secure IBE and Dual System Groups
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Tightly-Secure Signatures from Lossy Identification Schemes
Efficient Structure-Preserving Signature Scheme from Standard Assumptions
A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
Subgroup Security in Pairing-Based Cryptography
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Tight Proofs for Signature Schemes without Random Oracles
On the Efficient Implementation of Pairing-Based Protocols
Efficient Implementation of Bilinear Pairings on ARM Processors
Structure-Preserving Signatures from Standard Assumptions, Revisited
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
Batch Groth–Sahai
Group Encryption: Non-interactive Realization in the Standard Model
Randomness Re-use in Multi-recipient Encryption Schemeas
Efficient Noninteractive Proof Systems for Bilinear Groups
Implementing Pairings at the 192-Bit Security Level
Affine Pairings on ARM
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Adaptive Partitioning
Advances in Cryptology – CRYPTO 2004
Advances in Cryptology – CRYPTO 2004
Fine-Tuning Groth-Sahai Proofs
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
Algorithmic Number Theory