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 33 results in range #1 to #33.
- Deniable Encryption with Negligible Detection Probability: An Interactive Construction: Label: en
- Threshold and Revocation Cryptosystems via Extractable Hash Proofs: Label: en
- Decentralizing Attribute-Based Encryption: Label: en
- Unbounded HIBE and Attribute-Based Encryption: Label: en
- Key-Dependent Message Security: Generic Amplification and Completeness: Label: en
- Efficient Circuit-Size Independent Public Key Encryption with KDM Security: Label: en
- Careful with Composition: Limitations of the Indifferentiability Framework: Label: en
- Concurrent Composition in the Bounded Quantum Storage Model: Label: en
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption: Label: en
- Towards a Game Theoretic View of Secure Computation: Label: en
- Efficient Non-interactive Secure Computation: Label: en
- Two-Output Secure Computation with Malicious Adversaries: Label: en
- Improved Generic Algorithms for Hard Knapsacks: Label: en
- Statistical Attack on RC4: Label: en
- Domain Extension for MACs Beyond the Birthday Barrier: Label: en
- On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN: Label: en
- Almost Optimum t-Cheater Identifiable Secret Sharing Schemes: Label: en
- Secret Keys from Channel Noise: Label: en
- Secure Authentication from a Weak Key, without Leaking Information: Label: en
- Commuting Signatures and Verifiable Encryption: Label: en
- Adaptive Pseudo-free Groups and Applications: Label: en
- Tight Proofs for Signature Schemes without Random Oracles: Label: en
- Semi-homomorphic Encryption and Multiparty Computation: Label: en
- Homomorphic Signatures for Polynomial Functions: Label: en
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme: Label: en
- A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices: Label: en
- Fully Leakage-Resilient Signatures: Label: en
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES: Label: en
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves: Label: en
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices: Label: en
- Efficient Authentication from Hard Learning Problems: Label: en
- Lattice Reduction Algorithms: Theory and Practice: Label: en
- The Arithmetic Codex: Theory and Applications: Label: en