On the public citation graph

Computationally Private Randomizing Polynomials and Their Applications

0 signed · 58 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.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferredcites →https://doi.org/10.1007/3-540-39200-9_37openalex-snapshot
Efficient Multi-party Computation over Rings
inferredcites →https://doi.org/10.1007/3-540-45465-9_22openalex-snapshot
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_1openalex-snapshot
Notions of Reducibility between Cryptographic Primitives
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1090/dimacs/013/05openalex-snapshot
Locally random reductions in interactive complexity theory
inferredcites →https://doi.org/10.1109/ccc.2005.16openalex-snapshot
On Constructing Parallel Pseudorandom Generators from One-Way Functions
inferredcites →https://doi.org/10.1109/sct.1994.315817openalex-snapshot
NL/poly ⊆ ⊕L/poly
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.2000.892118openalex-snapshot
Randomizing polynomials: A new representation with applications to round-efficient secure computation
inferredcites →https://doi.org/10.1109/sfcs.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/080721820openalex-snapshot
On the Power of the Randomized Iterate
inferredcites →https://doi.org/10.1137/s0097539705446950openalex-snapshot
Cryptography in $NC^0$
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100287openalex-snapshot
The round complexity of secure protocols
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/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/336992.337028openalex-snapshot
Privacy preserving auctions and mechanism design
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/6490.6503openalex-snapshot
How to construct random functions
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11535218_23openalex-snapshot
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
inferred← citeshttps://doi.org/10.1007/11818175_30openalex-snapshot
Scalable Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_11openalex-snapshot
Round Optimal Black-Box “Commit-and-Prove”
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_22openalex-snapshot
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_24openalex-snapshot
On Actively-Secure Elementary MPC Reductions
inferred← citeshttps://doi.org/10.1007/978-3-030-97121-2_7openalex-snapshot
Reusable Two-Round MPC from LPN
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_1openalex-snapshot
Instance-Hiding Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_13openalex-snapshot
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-319-15943-0_6openalex-snapshot
Efficient Key Dependent Message Security Amplification Against Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_6openalex-snapshot
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_16openalex-snapshot
Two-Round Multiparty Secure Computation from Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_18openalex-snapshot
Adaptively Secure Garbling with Near Optimal Online Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_14openalex-snapshot
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_16openalex-snapshot
Secure Multi-party Computation Minimizing Online Rounds
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_23openalex-snapshot
Efficient Non-interactive Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_29openalex-snapshot
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_14openalex-snapshot
On the Cryptographic Complexity of the Worst Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_1openalex-snapshot
Statistical Randomized Encodings: A Complexity Theoretic View
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_32openalex-snapshot
From Selective to Adaptive Security in Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_26openalex-snapshot
Two Round Multiparty Computation via Multi-key FHE
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_16openalex-snapshot
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_6openalex-snapshot
Adaptively Secure Garbled Circuits from One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00037-018-0170-xopenalex-snapshot
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
inferred← citeshttps://doi.org/10.1007/s00145-026-09573-wopenalex-snapshot
Instance-Hiding Interactive Proofs
inferred← citeshttps://doi.org/10.1145/3566048openalex-snapshot
Two-round Multiparty Secure Computation from Minimal Assumptions
inferred← citeshttps://doi.org/10.1515/popets-2015-0013openalex-snapshot
Secure and scalable match: overcoming the universal circuit bottleneck using group programs
inferred← citeshttps://doi.org/10.17760/d20214470openalex-snapshot
New proof techniques for adaptive security
inferred← citeshttps://doi.org/10.9790/0661-1351420openalex-snapshot
Cryptographic Cloud Storage with Hadoop Implementation
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.