On the public citation graph

New notions of security

0 signed · 140 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-36108-1_2openalex-snapshot
Secure Computation without Agreement
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-44647-8_2openalex-snapshot
Universally Composable Commitments
inferredcites →https://doi.org/10.1007/3-540-46035-7_22openalex-snapshot
Universally Composable Notions of Key Exchange and Secure Channels
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-30576-7_7openalex-snapshot
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
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.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.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
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.2002.1181961openalex-snapshot
Concurrent zero knowledge with logarithmic round-complexity
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/sffcs.1999.814628openalex-snapshot
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
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/276698.276722openalex-snapshot
Non-interactive and non-malleable commitment
inferredcites →https://doi.org/10.1145/276698.276853openalex-snapshot
Concurrent zero-knowledge
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/352600.352639openalex-snapshot
Composition and integrity preservation of secure reactive systems
inferredcites →https://doi.org/10.1145/380752.380851openalex-snapshot
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
inferredcites →https://doi.org/10.1145/509907.509979openalex-snapshot
Strict polynomial-time in simulation and extraction
inferredcites →https://doi.org/10.1145/509907.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/780542.780605openalex-snapshot
Non-interactive and reusable non-malleable commitment schemes
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/11605805_21openalex-snapshot
Universally Composable Oblivious Transfer in the Multi-party Setting
inferred← citeshttps://doi.org/10.1007/11681878_18openalex-snapshot
Generalized Environmental Security from Number Theoretic Assumptions
inferred← citeshttps://doi.org/10.1007/11681878_19openalex-snapshot
Games and the Impossibility of Realizable Ideal Functionality
inferred← citeshttps://doi.org/10.1007/11681878_21openalex-snapshot
Resource Fairness and Composability of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/11863908_26openalex-snapshot
Conditional Reactive Simulatability
inferred← citeshttps://doi.org/10.1007/11958239_23openalex-snapshot
Universally Composable Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_8openalex-snapshot
One-Message Zero Knowledge and Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_7openalex-snapshot
A Unified and Composable Take on Ratcheting
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_8openalex-snapshot
Succinct Non-interactive Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_2openalex-snapshot
Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees
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_22openalex-snapshot
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_23openalex-snapshot
Adaptive Security of Multi-party Protocols, Revisited
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-22963-3_18openalex-snapshot
Concurrently Composable Non-interactive Secure Computation
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-031-48624-1_19openalex-snapshot
Composable Long-Term Security with Rewinding
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_3openalex-snapshot
R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_8openalex-snapshot
Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_21openalex-snapshot
Universally Composable Succinct Vector Commitments and Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_10openalex-snapshot
On the UC-(In)Security of PAKE Protocols Without the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_11openalex-snapshot
Just How Secure is SRP, Really?
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_22openalex-snapshot
Systematizing Secure Computation for Research and Decision Support
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_26openalex-snapshot
On Adaptively Secure Protocols
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-70500-2_25openalex-snapshot
Round Optimal Concurrent MPC via Strong Simulation
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_26openalex-snapshot
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_10openalex-snapshot
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_11openalex-snapshot
Non-malleability vs. CCA-Security: The Case of Commitments
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-30556-9_2openalex-snapshot
Secure Protocols for Complex Tasks in Complex Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_7openalex-snapshot
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
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-70936-7_4openalex-snapshot
Universally Composable Security with Global Setup
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_29openalex-snapshot
Rerandomizable RCCA Encryption
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-540-78524-8_9openalex-snapshot
Universally Composable Multi-party Computation with an Unreliable Common Reference String
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_15openalex-snapshot
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_29openalex-snapshot
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_4openalex-snapshot
Adaptive One-Way Functions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00862-7_25openalex-snapshot
Local Sequentiality Does Not Help for Concurrent Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-00941-9_7openalex-snapshot
Privacy Protection for WLAN
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-04642-1_3openalex-snapshot
Efficient Non-interactive Universally Composable String-Commitment Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_21openalex-snapshot
Optimistic Concurrent Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_23openalex-snapshot
Classical Cryptographic Protocols in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_24openalex-snapshot
A Framework for Practical Universally Composable Zero-Knowledge Protocols
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_24openalex-snapshot
Universal Composability from Essentially Any Trusted Setup
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-32928-9_16openalex-snapshot
Universally Composable Security with Local Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-642-34117-5_14openalex-snapshot
Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security
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-38348-9_41openalex-snapshot
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
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-40349-1_4openalex-snapshot
Non-invasive Spoofing Attacks for Anti-lock Braking Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_17openalex-snapshot
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_15openalex-snapshot
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_7openalex-snapshot
Achieving Constant Round Leakage-Resilient Zero-Knowledge
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-44381-1_20openalex-snapshot
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
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-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-53641-4_15openalex-snapshot
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_16openalex-snapshot
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-662-54388-7_15openalex-snapshot
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
inferred← citeshttps://doi.org/10.1007/978-981-95-5125-5_12openalex-snapshot
Round-Efficient Composable Two-Party Quantum Computation
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/s00145-007-0567-1openalex-snapshot
Concurrent Composition of Secure Protocols in the Timing Model
inferred← citeshttps://doi.org/10.1007/s00145-008-9021-2openalex-snapshot
General Composition and Universal Composability in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00145-009-9045-2openalex-snapshot
Efficient Non-malleable Commitment Schemes
inferred← citeshttps://doi.org/10.1007/s00145-010-9069-7openalex-snapshot
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
inferred← citeshttps://doi.org/10.1007/s00145-018-9276-1openalex-snapshot
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
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/s10207-007-0046-6openalex-snapshot
Conditional reactive simulatability
inferred← citeshttps://doi.org/10.1007/s10623-009-9320-0openalex-snapshot
Efficient hybrid encryption from ID-based encryption
inferred← citeshttps://doi.org/10.1007/s11432-007-0029-2openalex-snapshot
Universally composable anonymous Hash certification model
inferred← citeshttps://doi.org/10.1007/s11623-017-0720-4openalex-snapshot
Sicherheit relativ definieren
inferred← citeshttps://doi.org/10.1016/j.ic.2007.05.002openalex-snapshot
The reactive simulatability (RSIM) framework for asynchronous systems
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.262openalex-snapshot
Universally Composable Identity-Based Encryption
inferred← citeshttps://doi.org/10.1109/csf.2010.26openalex-snapshot
A Framework for the Sound Specification of Cryptographic Tasks
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00026openalex-snapshot
Provable Security Analysis of the Secure Remote Password Protocol
inferred← citeshttps://doi.org/10.1109/focs.2004.71openalex-snapshot
Universally Composable Protocols with Relaxed Set-Up Assumptions
inferred← citeshttps://doi.org/10.1109/focs.2006.21openalex-snapshot
Concurrent Non-Malleable Zero Knowledge
inferred← citeshttps://doi.org/10.1109/focs.2006.43openalex-snapshot
Input-Indistinguishable Computation
inferred← citeshttps://doi.org/10.1109/focs.2010.86openalex-snapshot
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
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/sfcs.2003.1238213openalex-snapshot
General composition and universal composability in secure multi-party computation
inferred← citeshttps://doi.org/10.1109/sfcs.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferred← citeshttps://doi.org/10.1109/vetecf.2005.1557522openalex-snapshot
Aggregative and attributes plantable routing discovery protocols
inferred← citeshttps://doi.org/10.1145/1060590.1060687openalex-snapshot
Concurrent general composition of secure protocols in the timing model
inferred← citeshttps://doi.org/10.1145/1189056.1189074openalex-snapshot
ACM SIGACT news distributed computing column 24
inferred← citeshttps://doi.org/10.1145/1536414.1536441openalex-snapshot
A unified framework for concurrent security
inferred← citeshttps://doi.org/10.14273/unisa-84openalex-snapshot
Secure computation under network and physical attacks
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.725openalex-snapshot
Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
inferred← citeshttps://doi.org/10.22331/q-2021-04-08-429openalex-snapshot
Towards Quantum One-Time Memories from Stateless Hardware
inferred← citeshttps://doi.org/10.3233/jcs-140523openalex-snapshot
Symbolic universal composability
inferred← citeshttps://doi.org/10.4230/lipics.aft.2025.13openalex-snapshot
A New Look at Composition of Authenticated Byzantine Generals
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2020.6openalex-snapshot
Quantum One-Time Memories from Stateless Hardware
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01625openalex-snapshot
Classical Cryptographic Protocols in a Quantum World
inferred← citeshttps://doi.org/10.5753/sbseg.2008.20891openalex-snapshot
On Possibility of Universally Composable Commitments Based on Noisy Channels
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.