On the public citation graph

Constant-Round Nonmalleable Commitments from Any One-Way Function

0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-39200-9_36openalex-snapshot
Round Efficiency of Multi-party Computation with a Dishonest Majority
inferredcites →https://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
inferredcites →https://doi.org/10.1007/3-540-44987-6_4openalex-snapshot
Efficient and Non-interactive Non-malleable Commitment
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_31openalex-snapshot
Concurrent Non-malleable Commitments from Any One-Way Function
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_4openalex-snapshot
Adaptive One-Way Functions and Applications
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_32openalex-snapshot
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_23openalex-snapshot
Concurrent Non-Malleable Zero Knowledge Proofs
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00208001openalex-snapshot
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1007/s00145-009-9045-2openalex-snapshot
Efficient Non-malleable Commitment Schemes
inferredcites →https://doi.org/10.1007/s001450010008openalex-snapshot
Universal Service-Providers for Private Information Retrieval
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1109/focs.2010.87openalex-snapshot
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
inferredcites →https://doi.org/10.1109/sfcs.1989.63483openalex-snapshot
One-way functions are essential for complexity based cryptography
inferredcites →https://doi.org/10.1109/sfcs.2002.1181957openalex-snapshot
Constant-round coin-tossing with a man in the middle or realizing the shared random string model
inferredcites →https://doi.org/10.1109/sfcs.2005.27openalex-snapshot
Concurrent Non-Malleable Commitments
inferredcites →https://doi.org/10.1109/sffcs.1999.814628openalex-snapshot
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539795291562openalex-snapshot
Nonmalleable Cryptography
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/1007352.1007393openalex-snapshot
Bounded-concurrent secure multi-party computation with a dishonest majority
inferredcites →https://doi.org/10.1145/1008908.1008911openalex-snapshot
Coin flipping by telephone a protocol for solving impossible problems
inferredcites →https://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
inferredcites →https://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferredcites →https://doi.org/10.1145/1536414.1536441openalex-snapshot
A unified framework for concurrent security
inferredcites →https://doi.org/10.1145/1536414.1536442openalex-snapshot
Non-malleability amplification
inferredcites →https://doi.org/10.1145/1993636.1993729openalex-snapshot
Constant round non-malleable protocols using one way functions
inferredcites →https://doi.org/10.1145/1993636.1993730openalex-snapshot
Constant-round non-malleable commitments from any one-way function
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/41840.41862openalex-snapshot
Achieving independence in logarithmic number of rounds
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.1145/780542.780605openalex-snapshot
Non-interactive and reusable non-malleable commitment schemes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_21openalex-snapshot
Game Theoretic Notions of Fairness in Multi-party Coin Toss
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_11openalex-snapshot
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-33491-7_22openalex-snapshot
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_5openalex-snapshot
Four-Round Statistical Non-malleable Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_5openalex-snapshot
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_10openalex-snapshot
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_10openalex-snapshot
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
inferred← citeshttps://doi.org/10.1007/s00145-020-09348-xopenalex-snapshot
Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
inferred← citeshttps://doi.org/10.1016/j.soildyn.2016.01.022openalex-snapshot
Dynamic analysis of a transversely isotropic multilayered half-plane subjected to a moving load
inferred← citeshttps://doi.org/10.1145/3303712openalex-snapshot
Distributed Protocols for Leader Election
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.