On the impossibility of structure-preserving deterministic primitives

DOI10.1007/s00145-018-9292-1zbMath1435.94120OpenAlexW2911487006MaRDI QIDQ1715860

Rafael Dowsley, Jan Camenisch, Maria Dubovitskaya, Masayuki Abe

Publication date: 29 January 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9292-1

zbMATH Keywords

Groth-Sahai proofsstructure-preserving cryptographyverifiable random functionsunique signatures

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

On the impossibility of algebraic NIZK in pairing-free groups ⋮ Aggregatable distributed key generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Pairings for cryptographers
• Efficient signature generation by smart cards
• Group to Group Commitments Do Not Shrink
• Efficient Structure-Preserving Signature Scheme from Standard Assumptions
• Tightly Secure Signatures and Public-Key Encryption
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Oblivious Transfer with Hidden Access Control Policies
• Structure Preserving CCA Secure Encryption and Applications
• Compact E-Cash and Simulatable VRFs Revisited
• Constructing Verifiable Random Functions with Large Input Spaces
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Deterministic and Efficiently Searchable Encryption
• On the Portability of Generalized Schnorr Proofs
• Verifiable Random Functions from Identity-Based Key Encapsulation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Efficient Construction of (Distributed) Verifiable Random Functions
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Group Signatures with Efficient Concurrent Join
• Compact E-Cash
• Fine-Tuning Groth-Sahai Proofs
• Advances in Cryptology - CRYPTO 2003
• Simulatable Adaptive Oblivious Transfer
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• P-signatures and Noninteractive Anonymous Credentials
• Updatable Zero-Knowledge Databases
• Public Key Cryptography - PKC 2005
• Theory of Cryptography

This page was built for publication: On the impossibility of structure-preserving deterministic primitives