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 conicsHierarchical Identity-Based Encryption with Tight Multi-challenge SecurityOn Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation SoundnessCertifying trapdoor permutations, revisitedQuantum algorithms for the \(k\)-XOR problem\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctionsFine-grained secure attribute-based encryptionUsing the numerical solution for partial fractional differential equation by ADI numerical method to cryptography in Hill matrix systemDual-mode NIZKs: possibility and impossibility results for property transferOn black-box extension of a non-interactive zero-knowledge proof system for secret equalityFully leakage-resilient signaturesThe 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D.QANIZK for adversary-dependent languages and their applicationsNIZKs with an Untrusted CRS: Security in the Face of Parameter SubversionFine-grained verifier NIZK and its applicationsResumable zero-knowledge for circuits from symmetric key primitivesHardness-preserving reductions via cuckoo hashingTrapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hidingA new public key cryptosystem over ℤn2*Updatable NIZKs from non-interactive zapsShorter quasi-adaptive NIZK proofs for linear subspacesOn the impossibility of algebraic NIZK in pairing-free groupsUnbounded HIBE with tight securitySimple and more efficient PRFs with tight security from LWE and matrix-DDHPseudo-free families of finite computational elementary abelian \(p\)-groupsSound and complete computational interpretation of symbolic hashes in the standard modelThe Security of Triple Encryption and a Framework for Code-Based Game-Playing ProofsFine-grained secure attribute-based encryptionUnlinkable Randomizable Signature and Its Application in Group SignatureAlgebraic Partitioning: Fully Compact and (almost) Tightly Secure CryptographyTraceable ring signatures: general framework and post-quantum securityConstrained PRFs for Unbounded Inputs with Short KeysCompact E-Cash and Simulatable VRFs RevisitedSynthesizers and their application to the parallel construction of pseudo-random functionsIBE with tight security against selective opening and chosen-ciphertext attacksNon-interactive zero-knowledge arguments for QMA, with preprocessingPseudorandom Functions: Three Decades LaterTurboIKOS: improved non-interactive zero knowledge and post-quantum signatures




This page was built for publication: