On the impossibility of structure-preserving deterministic primitives
From MaRDI portal
Recommendations
- On the impossibility of structure-preserving deterministic primitives
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Structure-preserving signatures and commitments to group elements
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2079926 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1842510 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Compact E-Cash
- Compact E-Cash and Simulatable VRFs Revisited
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Constructing verifiable random functions with large input spaces
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Efficient Construction of (Distributed) Verifiable Random Functions
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Efficient noninteractive proof systems for bilinear groups
- Efficient signature generation by smart cards
- Fine-Tuning Groth-Sahai Proofs
- Group Signatures with Efficient Concurrent Join
- Group to group commitments do not shrink
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Oblivious transfer with hidden access control policies
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the Portability of Generalized Schnorr Proofs
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- P-signatures and Noninteractive Anonymous Credentials
- Pairings for cryptographers
- Public Key Cryptography - PKC 2005
- Simulatable Adaptive Oblivious Transfer
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Structure preserving CCA secure encryption and applications
- Structure-preserving signatures and commitments to group elements
- Theory of Cryptography
- Tightly Secure Signatures and Public-Key Encryption
- Updatable Zero-Knowledge Databases
- Verifiable Random Functions from Identity-Based Key Encapsulation
Cited in
(5)
This page was built for publication: On the impossibility of structure-preserving deterministic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715860)
