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