The following pages link to (Q3729902):
Displaying 50 items.
- Leakage-resilient cryptography from minimal assumptions (Q315546) (← links)
- On the security of two identity-based conditional proxy re-encryption schemes (Q338380) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- Security proof of the canonical form of self-synchronizing stream ciphers (Q510485) (← links)
- The communication complexity of addition (Q519955) (← links)
- Long-term security and universal composability (Q604632) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Kernels as features: on kernels, margins, and low-dimensional mappings (Q851869) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Checking the correctness of memories (Q890427) (← links)
- FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes (Q895004) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- On learning a union of half spaces (Q915490) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- An unpredictability approach to finite-state randomness (Q1117699) (← links)
- A study of password security (Q1121243) (← links)
- Universal forecasting algorithms (Q1187027) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- A random number generator based on elliptic curve operations (Q1433102) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries (Q1631357) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Revocable hierarchical identity-based encryption with shorter private keys and update keys (Q1671645) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Keymill: side-channel resilient key generator, a new concept for SCA-security by design (Q1698634) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- On the security of the WOTS-PRF signature scheme (Q1726024) (← links)