scientific article; zbMATH DE number 4191103
From MaRDI portal
Publication:3210163
Recommendations
Cited in
(48)- Synthesizers and their application to the parallel construction of pseudo-random functions
- Certifying trapdoor permutations, revisited
- Quantum algorithms for the \(k\)-XOR problem
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Traceable ring signatures: general framework and post-quantum security
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Fine-grained secure attribute-based encryption
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Fully leakage-resilient signatures
- QANIZK for adversary-dependent languages and their applications
- Hardness-preserving reductions via cuckoo hashing
- Sound and complete computational interpretation of symbolic hashes in the standard model
- An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
- Unbounded HIBE with tight security
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Constrained PRFs for unbounded inputs with short keys
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Compact E-Cash and Simulatable VRFs Revisited
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Unlinkable Randomizable Signature and Its Application in Group Signature
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D.
- How to Utilize the Randomness of Zero-Knowledge Proofs
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
- scientific article; zbMATH DE number 1420968 (Why is no real title available?)
- Pseudorandom functions: three decades later
- Hierarchical identity-based encryption with tight multi-challenge security
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Using the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix system
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
- Fine-grained verifier NIZK and its applications
- Resumable zero-knowledge for circuits from symmetric key primitives
- Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
- Updatable NIZKs from non-interactive zaps
- Fine-grained secure attribute-based encryption
- On the impossibility of algebraic NIZK in pairing-free groups
- Digital friend-or-foe authentication
- zk-SNARKs from codes with rank metrics
- Sometimes you can't distribute random-oracle-based proofs
- Malleable SNARKs and their applications
- On quantum simulation-soundness
- IBE with tight security against selective opening and chosen-ciphertext attacks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210163)
