On the public citation graph

Input-Indistinguishable Computation

0 signed · 93 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-38424-3_6openalex-snapshot
Fair Computation of General Functions in Presence of Immoral Majority
inferredcites →https://doi.org/10.1007/3-540-39200-9_10openalex-snapshot
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition
inferredcites →https://doi.org/10.1007/3-540-39200-9_5openalex-snapshot
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
inferredcites →https://doi.org/10.1007/3-540-44598-6_5openalex-snapshot
Parallel Reducibility for Information-Theoretically Secure Computation
inferredcites →https://doi.org/10.1007/3-540-46766-1_31openalex-snapshot
Foundations of Secure Interactive Computing
inferredcites →https://doi.org/10.1007/3-540-48910-x_29openalex-snapshot
On the Concurrent Composition of Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_12openalex-snapshot
Lower Bounds for Concurrent Self Composition
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/s00145-008-9021-2openalex-snapshot
General Composition and Universal Composability in Secure Multiparty Computation
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1109/focs.2004.71openalex-snapshot
Universally Composable Protocols with Relaxed Set-Up Assumptions
inferredcites →https://doi.org/10.1109/secpri.2001.924298openalex-snapshot
A model for asynchronous reactive systems and its application to secure message transmission
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.1998.743499openalex-snapshot
Lower bounds for zero knowledge on the Internet
inferredcites →https://doi.org/10.1109/sfcs.2001.959885openalex-snapshot
How to go beyond the black-box simulation barrier
inferredcites →https://doi.org/10.1109/sfcs.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
inferredcites →https://doi.org/10.1109/sfcs.2002.1181961openalex-snapshot
Concurrent zero knowledge with logarithmic round-complexity
inferredcites →https://doi.org/10.1109/sfcs.2003.1238213openalex-snapshot
General composition and universal composability in secure multi-party computation
inferredcites →https://doi.org/10.1109/sfcs.2003.1238214openalex-snapshot
Bounded-concurrent secure two-party computation in a constant number of rounds
inferredcites →https://doi.org/10.1109/sfcs.2005.27openalex-snapshot
Concurrent Non-Malleable Commitments
inferredcites →https://doi.org/10.1109/sfcs.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0220068openalex-snapshot
Noninteractive Zero-Knowledge
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1137/s0097539795291562openalex-snapshot
Nonmalleable Cryptography
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/1007352.1007394openalex-snapshot
New notions of security
inferredcites →https://doi.org/10.1145/1011767.1011769openalex-snapshot
Completely fair SFE and coalition-safe cheap talk
inferredcites →https://doi.org/10.1145/103418.103474openalex-snapshot
Non-malleable cryptography
inferredcites →https://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
inferredcites →https://doi.org/10.1145/1060590.1060687openalex-snapshot
Concurrent general composition of secure protocols in the timing model
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/276698.276853openalex-snapshot
Concurrent zero-knowledge
inferredcites →https://doi.org/10.1145/380752.380851openalex-snapshot
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
inferredcites →https://doi.org/10.1145/509978.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/73007.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority
inferredcites →https://doi.org/10.1145/780542.780641openalex-snapshot
Bounded-concurrent secure two-party computation without setup assumptions

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-57990-6_5openalex-snapshot
Black-Box Constructions of Bounded-Concurrent Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_25openalex-snapshot
Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-15985-5_14openalex-snapshot
A New Approach to Efficient Non-Malleable Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-33017-9_11openalex-snapshot
Multi-input Non-interactive Functional Encryption: Constructions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_5openalex-snapshot
On Concurrent Multi-party Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-01884-7_1openalex-snapshot
The Round Complexity of Black-Box Post-quantum Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_12openalex-snapshot
Just-in-Time-OPRFs and a Modular Framework for Fast Private Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_26openalex-snapshot
What Security Can We Achieve Within 4 Rounds?
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_7openalex-snapshot
On the Exact Round Complexity of Self-composable Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_13openalex-snapshot
Concurrently Composable Security with Shielded Super-Polynomial Simulators
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_6openalex-snapshot
Distinguisher-Dependent Simulation in Two Rounds and its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_19openalex-snapshot
A New Approach to Black-Box Concurrent Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_45openalex-snapshot
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_18openalex-snapshot
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_6openalex-snapshot
Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_8openalex-snapshot
Computational Differential Privacy
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_59openalex-snapshot
Concurrent Knowledge Extraction in the Public-Key Model
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_8openalex-snapshot
Concurrently Secure Computation in Constant Rounds
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_25openalex-snapshot
Impossibility Results for Static Input Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_26openalex-snapshot
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_27openalex-snapshot
Black-Box Constructions of Composable Protocols without Set-Up
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_42openalex-snapshot
A Unified Framework for UC from Only OT
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_40openalex-snapshot
On Concurrently Secure Computation in the Multiple Ideal Query Model
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_13openalex-snapshot
What Information Is Leaked under Concurrent Composition?
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_28openalex-snapshot
Functional Encryption: New Perspectives and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_37openalex-snapshot
Cross-Domain Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_74openalex-snapshot
On Input Indistinguishable Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_24openalex-snapshot
How to Use Bitcoin to Design Fair Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_11openalex-snapshot
Richer Efficiency/Security Trade-offs in 2PC
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_12openalex-snapshot
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_16openalex-snapshot
End-to-End Verifiable Elections in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_17openalex-snapshot
Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_2openalex-snapshot
Concurrent Secure Computation via Non-Black Box Simulation
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_3openalex-snapshot
Concurrent Secure Computation with Optimal Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-53357-4_13openalex-snapshot
On the Possibility of Non-interactive E-Voting in the Public-Key Setting
inferred← citeshttps://doi.org/10.1007/978-981-95-5125-5_14openalex-snapshot
Almost-Total Puzzles and Their Applications
inferred← citeshttps://doi.org/10.1007/978-981-99-8721-4_12openalex-snapshot
Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus
inferred← citeshttps://doi.org/10.1007/978-981-99-8721-4_3openalex-snapshot
Two-Round Concurrent 2PC from Sub-exponential LWE
inferred← citeshttps://doi.org/10.1007/s00145-019-09323-1openalex-snapshot
What Security Can We Achieve Within 4 Rounds?
inferred← citeshttps://doi.org/10.1007/s00453-020-00750-2openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1109/focs.2012.13openalex-snapshot
Positive Results for Concurrently Secure Computation in the Plain Model
inferred← citeshttps://doi.org/10.1109/focs.2012.47openalex-snapshot
Constructing Non-malleable Commitments: A Black-Box Approach
inferred← citeshttps://doi.org/10.1109/focs.2013.16openalex-snapshot
From Unprovability to Environmentally Friendly Protocols
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00041openalex-snapshot
A New Approach to Post-Quantum Non-Malleability
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3552670openalex-snapshot
Increasing the Resilience of Secure Multiparty Computation Using Security Modules
inferred← citeshttps://doi.org/10.1109/tsc.2024.3440012openalex-snapshot
Confidential Distributed Ledgers for Online Syndicated Lending
inferred← citeshttps://doi.org/10.1145/1536414.1536441openalex-snapshot
A unified framework for concurrent security
inferred← citeshttps://doi.org/10.1145/1993636.1993729openalex-snapshot
Constant round non-malleable protocols using one way functions
inferred← citeshttps://doi.org/10.1145/3146549openalex-snapshot
Distributed Private Data Analysis
inferred← citeshttps://doi.org/10.1145/3243734.3243788openalex-snapshot
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody
inferred← citeshttps://doi.org/10.48550/arxiv.0908.2476openalex-snapshot
Concurrent Knowledge-Extraction in the Public-Key Model
inferred← citeshttps://doi.org/10.48550/arxiv.0910.3282openalex-snapshot
Adaptive Concurrent Non-Malleability with Bare Public-Keys
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.