scientific article; zbMATH DE number 1842511
From MaRDI portal
Publication:4783745
zbMath1003.94526MaRDI QIDQ4783745
Giuseppe Persiano, Rafail Ostrovsky, Alfredo De Santis, Giovanni Di Crescenzo, Amit Sahai
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390566
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Witness authenticating NIZKs and applications ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ Selectively linkable group signatures -- stronger security and preserved verifiability ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ A Unified Framework for Non-universal SNARKs ⋮ Continuously non-malleable secret sharing for general access structures ⋮ Round-optimal password-based authenticated key exchange ⋮ Witness-succinct universally-composable SNARKs ⋮ Privacy-preserving blueprints ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Triply adaptive UC NIZK ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Updatable NIZKs from non-interactive zaps ⋮ Unnamed Item ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Practical non-malleable codes from symmetric-key primitives in 2-split-state model ⋮ On constant-round concurrent non-malleable proof systems ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy ⋮ Continuously non-malleable codes in the split-state model ⋮ Leakage-resilient ring signature schemes ⋮ Cryptography and cryptographic protocols ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Verifiable Elections That Scale for Free ⋮ Leakage-resilient group signature: definitions and constructions ⋮ Novel \(\Omega\)-protocols for NP ⋮ Post-challenge leakage in public-key encryption ⋮ Perfect Non-interactive Zero Knowledge for NP ⋮ A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor ⋮ Completely Non-malleable Encryption Revisited ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Cryptography in the multi-string model ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Secure software leasing ⋮ Abuse resistant law enforcement access systems ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Leakage resilience from program obfuscation ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
This page was built for publication:
