On the public citation graph

Reducing Complexity Assumptions for Statistically-Hiding Commitment*

https://doi.org/10.2139/ssrn.1157394
0 signed · 45 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/0-387-34799-2_2openalex-extracted
Limits on the Provable Consequences of One-way Permutations
inferredcites →https://doi.org/10.1007/11426639_4openalex-extracted
Reducing Complexity Assumptions for Statistically-Hiding Commitment
inferredcites →https://doi.org/10.1007/3-540-39118-5_19openalex-extracted
Collision Free Hash Functions and Public Key Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-45760-7_7openalex-extracted
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
inferredcites →https://doi.org/10.1007/3-540-46877-3_37openalex-extracted
On the Design of Provably-Secure Cryptographic Hash Functions
inferredcites →https://doi.org/10.1007/3-540-48071-4_30openalex-extracted
Necessary and Sufficient Conditions for Collision-Free Hashing
inferredcites →https://doi.org/10.1007/3-540-48329-2_22openalex-extracted
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
inferredcites →https://doi.org/10.1007/3-540-55210-3_203openalex-extracted
Secure commitment against a powerful adversary
inferredcites →https://doi.org/10.1007/3-540-68697-5_16openalex-extracted
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_31openalex-extracted
Fair Games Against an All-Powerful Adversary
inferredcites →https://doi.org/10.1007/978-3-662-12521-2openalex-extracted
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferredcites →https://doi.org/10.1007/bf00190757openalex-extracted
Necessary and sufficient conditions for collision-free hashing
inferredcites →https://doi.org/10.1007/bf00196774openalex-extracted
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00204448openalex-extracted
A discrete logarithm implementation of perfect zero-knowledge blobs
inferredcites →https://doi.org/10.1007/bf00208001openalex-extracted
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1007/s00145-002-0143-7openalex-extracted
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/s001459900026openalex-extracted
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
inferredcites →https://doi.org/10.1007/s001459900037openalex-extracted
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-extracted
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-extracted
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-extracted
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0885-064x(89)90015-0openalex-extracted
On the power of two-point based sampling
inferredcites →https://doi.org/10.1090/dimacs/013/09openalex-extracted
Fair games against an all-powerful adversary
inferredcites →https://doi.org/10.1109/focs.2006.71openalex-extracted
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
inferredcites →https://doi.org/10.1109/fscs.1990.89550openalex-extracted
Security preserving amplification of hardness
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-extracted
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.72openalex-extracted
How to generate cryptographically strong sequences of pseudo random bits
inferredcites →https://doi.org/10.1109/sfcs.1989.63483openalex-extracted
One-way functions are essential for complexity based cryptography
inferredcites →https://doi.org/10.1109/sfcs.1997.646126openalex-extracted
Does parallel repetition lower the error in computationally sound protocols?
inferredcites →https://doi.org/10.1137/0213053openalex-extracted
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0217017openalex-extracted
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0220068openalex-extracted
Noninteractive Zero-Knowledge
inferredcites →https://doi.org/10.1137/0222069openalex-extracted
On the Existence of Pseudorandom Generators
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-extracted
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-extracted
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s089548019223872xopenalex-extracted
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferredcites →https://doi.org/10.1145/100216.100269openalex-extracted
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/116825.116852openalex-extracted
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferredcites →https://doi.org/10.1145/1250790.1250792openalex-extracted
Statistically-hiding commitment from any one-way function
inferredcites →https://doi.org/10.1145/147508.147537openalex-extracted
How to sign given any trapdoor permutation
inferredcites →https://doi.org/10.1145/6490.6503openalex-extracted
How to construct random functions
inferredcites →https://doi.org/10.1145/73007.73010openalex-extracted
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-extracted
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.1145/73007.73012openalex-extracted
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.1007/s00145-012-9139-0openalex-snapshot
A New Interactive Hashing Theorem
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.