Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 31 results in range #1 to #31.
- Efficient Pseudorandom Generators Based on the DDH Assumption: Label: en
- Fast Batch Verification of Multiple Signatures: Label: en
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications: Label: en
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol: Label: en
- Identity-Based Traitor Tracing: Label: en
- Verifiable Shuffle of Large Size Ciphertexts: Label: en
- Practical and Secure Solutions for Integer Comparison: Label: en
- Parallel Key-Insulated Public Key Encryption Without Random Oracles: Label: en
- Multi-bit Cryptosystems Based on Lattice Problems: Label: en
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman: Label: en
- ℓ-Invertible Cycles for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic ( ${\mathcal{MQ}}$ ) Public Key Cryptography: Label: en
- High Order Linearization Equation (HOLE) Attack on Multivariate Public Key Cryptosystems: Label: en
- Cryptanalysis of HFE with Internal Perturbation: Label: en
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles: Label: en
- Improved On-Line/Off-Line Threshold Signatures: Label: en
- Efficient Ring Signatures Without Random Oracles: Label: en
- Traceable Ring Signature: Label: en
- Knowledge-Binding Commitments with Applications in Time-Stamping: Label: en
- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures: Label: en
- Optimistic Fair Exchange in a Multi-user Setting: Label: en
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol: Label: en
- New Chosen-Ciphertext Attacks on NTRU: Label: en
- Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003: Label: en
- Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions: Label: en
- Anonymous Signatures Made Easy: Label: en
- On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures: Label: en
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures: Label: en
- A Direct Anonymous Attestation Scheme for Embedded Devices: Label: en
- A Closer Look at PKI: Security and Efficiency: Label: en
- Self-Generated-Certificate Public Key Encryption Without Pairing: Label: en
- Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA: Label: en