The following pages link to (Q3210163):
Displaying 35 items.
- An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics (Q268490) (← links)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Pseudo-free families of finite computational elementary abelian \(p\)-groups (Q524639) (← links)
- IBE with tight security against selective opening and chosen-ciphertext attacks (Q780378) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Shorter quasi-adaptive NIZK proofs for linear subspaces (Q1698397) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Fine-grained secure attribute-based encryption (Q2139633) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- QANIZK for adversary-dependent languages and their applications (Q2420581) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- Unbounded HIBE with tight security (Q2692379) (← links)
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography (Q2796128) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs (Q3593109) (← links)
- Unlinkable Randomizable Signature and Its Application in Group Signature (Q3600344) (← links)
- A new public key cryptosystem over ℤn2* (Q4597967) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security (Q5041156) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- Using the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix system (Q5059605) (← links)
- Fine-grained secure attribute-based encryption (Q6176273) (← links)
- zk-SNARKs from codes with rank metrics (Q6595937) (← links)
- Sometimes you can't distribute random-oracle-based proofs (Q6652973) (← links)
