A new interactive hashing theorem (Q2442643)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A new interactive hashing theorem	scientific article

Statements

scholarly article

0 references

A new interactive hashing theorem (English)

0 references

0 references

0 references

Journal of Cryptology

0 references

publication date

1 April 2014

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-012-9139-0

0 references

Minimum disclosure proofs of knowledge

0 references

Universal classes of hash functions

0 references

Foundations of Cryptography

0 references

0 references

Reducing complexity assumptions for statistically-hiding commitment

0 references

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

0 references

Inaccessible entropy

0 references

On the Power of the Randomized Iterate

0 references

A Pseudorandom Generator from any One-way Function

0 references

Parallel coin-tossing and constant-round secure two-party computation

0 references

Perfect zero-knowledge arguments for NP using any one-way permutation

0 references

Secure commitment against a powerful adversary

0 references

0 references

0 references

One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00145-012-9139-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2442643

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2442643&oldid=39085766"