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 39 results in range #1 to #39.
- Sampling in a Quantum Population, and Applications: Label: en
- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions: Label: en
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries: Label: en
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks: Label: en
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs: Label: en
- Cryptographic Extraction and Key Derivation: The HKDF Scheme: Label: en
- On Generalized Feistel Networks: Label: en
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security: Label: en
- Secure Multiparty Computation with Minimal Interaction: Label: en
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost: Label: en
- Protocols for Multiparty Coin Toss with Dishonest Majority: Label: en
- On Strong Simulation and Composable Point Obfuscation: Label: en
- Oblivious RAM Revisited: Label: en
- Improved Delegation of Computation Using Fully Homomorphic Encryption: Label: en
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers: Label: en
- Equivalence of Uniform Key Agreement and Composition Insecurity: Label: en
- Concurrent Non-Malleable Zero Knowledge Proofs: Label: en
- Universally Composable Incoercibility: Label: en
- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony: Label: en
- Improved Differential Attacks for ECHO and Grøstl: Label: en
- Correcting Errors in RSA Private Keys: Label: en
- Factorization of a 768-Bit RSA Modulus: Label: en
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs: Label: en
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack: Label: en
- Password-Authenticated Session-Key Generation on the Internet in the Plain Model: Label: en
- Credential Authenticated Identification and Key Exchange: Label: en
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves: Label: en
- Structure-Preserving Signatures and Commitments to Group Elements: Label: en
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption: Label: en
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography: Label: en
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits: Label: en
- Additively Homomorphic Encryption with d-Operand Multiplications: Label: en
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness: Label: en
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE: Label: en
- An Efficient and Parallel Gaussian Sampler for Lattices: Label: en
- Securing Computation against Continuous Leakage: Label: en
- Protecting Cryptographic Keys against Continual Leakage: Label: en
- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks: Label: en
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability: Label: en