scientific article
From MaRDI portal
Publication:3210163
zbMath0722.68042MaRDI QIDQ3210163
Shafi Goldwasser, Mihir Bellare
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics ⋮ 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 ⋮ Certifying trapdoor permutations, revisited ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ 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 ⋮ 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 ⋮ The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. ⋮ QANIZK for adversary-dependent languages and their applications ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Fine-grained verifier NIZK and its applications ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding ⋮ A new public key cryptosystem over ℤn2* ⋮ Updatable NIZKs from non-interactive zaps ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Unbounded HIBE with tight security ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Pseudo-free families of finite computational elementary abelian \(p\)-groups ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs ⋮ Fine-grained secure attribute-based encryption ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Constrained PRFs for Unbounded Inputs with Short Keys ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks ⋮ Non-interactive zero-knowledge arguments for QMA, with preprocessing ⋮ Pseudorandom Functions: Three Decades Later ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication:
