Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787)

scientific article; zbMATH DE number 7440638

Language	Label	Description	Also known as
English	Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments	scientific article; zbMATH DE number 7440638

Statements

instance of

scholarly article

0 references

title

Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (English)

0 references

author

Dakshita Khurana

0 references

publication date

8 December 2021

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-77883-5_7

0 references

cites work

Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation

0 references

Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE

0 references

Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

0 references

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

0 references

Two-message witness indistinguishability and secure computation in the plain model from new assumptions

0 references

On the (im)possibility of obfuscating programs

0 references

Derandomization in Cryptography

0 references

Theory of Cryptography

0 references

Contention in Cryptoland: Obfuscation, Leakage and UCE

0 references

Time-lock puzzles from randomized encodings

0 references

Weak zero-knowledge beyond the black-box barrier

0 references

One-message zero knowledge and non-malleable commitments

0 references

Point Obfuscation and 3-Round Zero-Knowledge

0 references

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation

0 references

Post-quantum zero knowledge in constant rounds

0 references

Candidate iO from homomorphic encryption schemes

0 references

Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input

0 references

Resettable zero-knowledge (extended abstract)

0 references

Adaptive hardness and composable security in the plain model from standard assumptions

0 references

From Weak to Strong Zero-Knowledge and Applications

0 references

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

0 references

Four-round concurrent non-malleable commitments from one-way functions

0 references

Spooky Encryption and Its Applications

0 references

Magic Functions

0 references

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

0 references

Black-box non-interactive non-malleable commitments

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

0 references

Foundations of Cryptography

0 references

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

0 references

Definitions and properties of zero-knowledge proof systems

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

Constant round non-malleable protocols using one way functions

0 references

Textbook non-malleable commitments

0 references

New Techniques for Noninteractive Zero-Knowledge

0 references

How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)

0 references

Distinguisher-dependent simulation in two rounds and its applications

0 references

Non-interactive non-malleability from quantum supremacy

0 references

Round optimal concurrent non-malleability from polynomial hardness

0 references

Towards non-interactive witness hiding

0 references

Constant-round non-malleable commitments from any one-way function

0 references

Non-malleability amplification

0 references

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles

0 references

Concurrent Non-malleable Commitments from Any One-Way Function

0 references

Adaptive One-Way Functions and Applications

0 references

Q4434874

0 references

New and Improved Constructions of Nonmalleable Cryptographic Protocols

0 references

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions

0 references

Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I

0 references

How to use indistinguishability obfuscation

0 references

Candidate obfuscation via oblivious LWE sampling

0 references

Identifiers

DOI

10.1007/978-3-030-77883-5_7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2056787