scientific article; zbMATH DE number 4191103
From MaRDI portal
Publication:3210163
zbMATH Open0722.68042MaRDI QIDQ3210163FDOQ3210163
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Cited In (44)
- Quantum algorithms for the \(k\)-XOR problem
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D.
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Updatable NIZKs from non-interactive zaps
- Pseudorandom Functions: Three Decades Later
- Title not available (Why is that?)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- A new public key cryptosystem over ℤn2*
- zk-SNARKs from codes with rank metrics
- Unbounded HIBE with tight security
- Compact E-Cash and Simulatable VRFs Revisited
- An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Title not available (Why is that?)
- Fine-grained verifier NIZK and its applications
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- On the impossibility of algebraic NIZK in pairing-free groups
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
- Traceable ring signatures: general framework and post-quantum security
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Certifying trapdoor permutations, revisited
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Hardness-preserving reductions via cuckoo hashing
- IBE with tight security against selective opening and chosen-ciphertext attacks
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
- Sometimes you can't distribute random-oracle-based proofs
- Fully leakage-resilient signatures
- Title not available (Why is that?)
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- Using the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix system
- Resumable zero-knowledge for circuits from symmetric key primitives
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Constrained PRFs for Unbounded Inputs with Short Keys
- Title not available (Why is that?)
- Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
- QANIZK for adversary-dependent languages and their applications
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
- Unlinkable Randomizable Signature and Its Application in Group Signature
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)
