Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
type: Item
instance of: scholarly article
title: Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
DOI: 10.1007/978-3-030-77883-5_7
author: Dakshita Khurana
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440638
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 7
OpenAlex ID: W3170051467
cites work: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
cites work: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
cites work: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
cites work: Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: On the (im)possibility of obfuscating programs
cites work: Derandomization in Cryptography
cites work: Theory of Cryptography
cites work: Contention in Cryptoland: Obfuscation, Leakage and UCE
cites work: Time-lock puzzles from randomized encodings
cites work: Weak zero-knowledge beyond the black-box barrier
cites work: One-message zero knowledge and non-malleable commitments
cites work: Point Obfuscation and 3-Round Zero-Knowledge
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Post-quantum zero knowledge in constant rounds
cites work: Candidate iO from homomorphic encryption schemes
cites work: Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
cites work: Resettable zero-knowledge (extended abstract)
cites work: Adaptive hardness and composable security in the plain model from standard assumptions
cites work: From Weak to Strong Zero-Knowledge and Applications
cites work: Concurrent Non-Malleable Commitments (and More) in 3 Rounds
cites work: Four-round concurrent non-malleable commitments from one-way functions
cites work: Spooky Encryption and Its Applications
cites work: Magic Functions
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Black-box non-interactive non-malleable commitments
cites work: Two-Round Secure MPC from Indistinguishability Obfuscation
cites work: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
cites work: Foundations of Cryptography
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Constant round non-malleable protocols using one way functions
cites work: Textbook non-malleable commitments
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: Non-interactive non-malleability from quantum supremacy
cites work: Round optimal concurrent non-malleability from polynomial hardness
cites work: Towards non-interactive witness hiding
cites work: Constant-round non-malleable commitments from any one-way function
cites work: Non-malleability amplification
cites work: Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
cites work: Concurrent Non-malleable Commitments from Any One-Way Function
cites work: Adaptive One-Way Functions and Applications
cites work: Q4434874
cites work: New and Improved Constructions of Nonmalleable Cryptographic Protocols
cites work: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
cites work: Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
cites work: How to use indistinguishability obfuscation
cites work: Candidate obfuscation via oblivious LWE sampling
description: scientific article; zbMATH DE number 7440638