On the public citation graph
Secure Computation Without Authentication
0 signed · 113 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11426639_24openalex-snapshot
Universally Composable Password-Based Key Exchange
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-44647-8_24openalex-snapshot
Session-Key Generation Using Human Passwords Only
inferredcites →https://doi.org/10.1007/3-540-48071-4_10openalex-snapshot
Pricing via Processing or Combatting Junk Mail
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/978-3-540-24638-1_24openalex-snapshot
Simpler Session-Key Generation from Short Random Passwords
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_16openalex-snapshot
Universal Composition with Joint State
inferredcites →https://doi.org/10.1007/978-3-540-70936-7_4openalex-snapshot
Universally Composable Security with Global Setup
inferredcites →https://doi.org/10.1007/s001459910004openalex-snapshot
Maintaining Authenticated Communication in the Presence of Break-Ins
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1109/csfw.2004.24openalex-snapshot
Universally composable signature, certification, and authentication
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
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.2003.1238214openalex-snapshot
Bounded-concurrent secure two-party computation in a constant number of rounds
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.1145/1007352.1007393openalex-snapshot
Bounded-concurrent secure multi-party computation with a dishonest majority
inferredcites →https://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
inferredcites →https://doi.org/10.1145/322510.322514openalex-snapshot
Public-key cryptography and password protocols
inferredcites →https://doi.org/10.1145/509907.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.1145/571825.571841openalex-snapshot
Detectable byzantine agreement secure against faulty majorities
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/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.1002/9781394188369.ch10openalex-snapshot
Password Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1002/dac.2746openalex-snapshot
Universally composable three‐party password‐authenticated key exchange with contributiveness
inferred← citeshttps://doi.org/10.1007/11958239_23openalex-snapshot
Universally Composable Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_9openalex-snapshot
Interactive Non-malleable Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_6openalex-snapshot
Efficient Constructions for Almost-Everywhere Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_29openalex-snapshot
Separating Symmetric and Asymmetric Password-Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-030-58951-6_33openalex-snapshot
Where Are You Bob? Privacy-Preserving Proximity Testing with a Napping Party
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_24openalex-snapshot
Crowd Verifiable Zero-Knowledge and End-to-End Verifiable Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-78086-9_9openalex-snapshot
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_20openalex-snapshot
Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus
inferred← citeshttps://doi.org/10.1007/978-3-032-25317-0_16openalex-snapshot
Conditionally Input-Revealing 2PC and Fuzzy Password-Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_2openalex-snapshot
Password-Based Authenticated Key Exchange without Centralized Trusted Setup
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_3openalex-snapshot
Secure Key Exchange and Sessions without Credentials
inferred← citeshttps://doi.org/10.1007/978-3-319-12475-9_1openalex-snapshot
Password-Based Authenticated Key Exchange: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-319-49890-4_7openalex-snapshot
UC-secure and Contributory Password-Authenticated Group Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_22openalex-snapshot
Analysis of the Blockchain Protocol in Asynchronous Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_2openalex-snapshot
Two-Round PAKE from Approximate SPH and Instantiations from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_13openalex-snapshot
Fuzzy Password-Authenticated Key Exchange
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-72540-4_7openalex-snapshot
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_28openalex-snapshot
Collusion-Free Protocols in the Mediated Model
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_9openalex-snapshot
Distributed Public-Key Cryptography from Weak Secrets
inferred← citeshttps://doi.org/10.1007/978-3-642-02384-2_16openalex-snapshot
Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_31openalex-snapshot
Collusion-Free Multiparty Computation in the Mediated Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_39openalex-snapshot
Smooth Projective Hashing for Conditionally Extractable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_18openalex-snapshot
Strong Cryptography from Weak Secrets
inferred← citeshttps://doi.org/10.1007/978-3-642-13346-6_4openalex-snapshot
A Variant of Naor-Pinkas Oblivious Transfer for More Efficient Authentication
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_14openalex-snapshot
Credential Authenticated Identification and Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_15openalex-snapshot
Password-Authenticated Session-Key Generation on the Internet in the Plain Model
inferred← citeshttps://doi.org/10.1007/978-3-642-19074-2_11openalex-snapshot
Contributory Password-Authenticated Group Key Exchange with Join Capability
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_18openalex-snapshot
Round-Optimal Password-Based Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_24openalex-snapshot
Player-Centric Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_24openalex-snapshot
Position-Based Quantum Cryptography: Impossibility and Constructions
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-29852-3_8openalex-snapshot
Post-Session Authentication
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_23openalex-snapshot
Password-Based Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_27openalex-snapshot
Efficient Password Authenticated Key Exchange via Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_18openalex-snapshot
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
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-42033-7_12openalex-snapshot
SPHF-Friendly Non-interactive Commitments
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_13openalex-snapshot
Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions
inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_24openalex-snapshot
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_11openalex-snapshot
Universally Composable Authentication and Key-Exchange with Global PKI
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_25openalex-snapshot
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_12openalex-snapshot
Structure-Preserving Smooth Projective Hashing
inferred← citeshttps://doi.org/10.1007/978-3-662-54365-8_7openalex-snapshot
Removing Erasures with Explainable Hash Proof Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-5096-8_4openalex-snapshot
Universally Composable Subversion-Resilient Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/978-981-96-0935-2_4openalex-snapshot
Key Exchange in the Post-snowden Era: Universally Composable Subversion-Resilient PAKE
inferred← citeshttps://doi.org/10.1007/978-981-99-8742-9_4openalex-snapshot
Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes
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-010-9069-7openalex-snapshot
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
inferred← citeshttps://doi.org/10.1007/s00145-013-9160-yopenalex-snapshot
GNUC: A New Universal Composability Framework
inferred← citeshttps://doi.org/10.1007/s00145-013-9176-3openalex-snapshot
Almost-Everywhere Secure Computation with Edge Corruptions
inferred← citeshttps://doi.org/10.1007/s00145-025-09565-2openalex-snapshot
Universally Composable Almost-Everywhere Secure Computation
inferred← citeshttps://doi.org/10.1007/s00224-007-9006-9openalex-snapshot
Efficient Algorithms for Anonymous Byzantine Agreement
inferred← citeshttps://doi.org/10.1080/01611194.2015.1135487openalex-snapshot
Chaum's protocol for detecting man-in-the-middle: Explanation, demonstration, and timing studies for a text-messaging scenario
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.262openalex-snapshot
Universally Composable Identity-Based Encryption
inferred← citeshttps://doi.org/10.1109/euc.2008.114openalex-snapshot
Secure Authentication in Wireless Sensor Networks Using RF Fingerprints
inferred← citeshttps://doi.org/10.1109/eurosp.2017.36openalex-snapshot
Privacy-Preserving User-Auditable Pseudonym Systems
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.2013.16openalex-snapshot
From Unprovability to Environmentally Friendly Protocols
inferred← citeshttps://doi.org/10.1109/isit.2014.6875089openalex-snapshot
Intercepting tokens in cryptographic protocols: The empire strikes back in the clone wars
inferred← citeshttps://doi.org/10.1109/itwtpi.2005.1543955openalex-snapshot
Broadcast and secure computation under reduced setup assumptions
inferred← citeshttps://doi.org/10.1109/msp.2017.71openalex-snapshot
An Efficient E2E Verifiable E-voting System without Setup Assumptions
inferred← citeshttps://doi.org/10.1109/sfcs.2005.27openalex-snapshot
Concurrent Non-Malleable Commitments
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.1137/060661880openalex-snapshot
Concurrent Nonmalleable Commitments
inferred← citeshttps://doi.org/10.1145/1165555.1165570openalex-snapshot
Security and composition of cryptographic protocols
inferred← citeshttps://doi.org/10.1145/1189056.1189074openalex-snapshot
ACM SIGACT news distributed computing column 24
inferred← citeshttps://doi.org/10.1145/1806689.1806717openalex-snapshot
On the round complexity of covert computation
inferred← citeshttps://doi.org/10.1145/1866307.1866365openalex-snapshot
A new framework for efficient password-based authenticated key exchange
inferred← citeshttps://doi.org/10.1145/3566048openalex-snapshot
Two-round Multiparty Secure Computation from Minimal Assumptions
inferred← citeshttps://doi.org/10.1155/2009/702346openalex-snapshot
Noninteractive, Anonymously Authenticated, and Traceable Message Transmission for VANETs
inferred← citeshttps://doi.org/10.1587/transfun.2019dmp0006openalex-snapshot
Password-Based Authenticated Key Exchange without Centralized Trusted Setup
inferred← citeshttps://doi.org/10.3390/cryptography5030022openalex-snapshot
Foundations of Programmable Secure Computation
inferred← citeshttps://doi.org/10.4018/978-1-60960-777-7.ch003openalex-snapshot
Security Issues for Multi-Domain Resource Reservation
inferred← citeshttps://doi.org/10.48550/arxiv.1005.5020openalex-snapshot
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
inferred← citeshttps://doi.org/10.5815/ijcnis.2015.10.03openalex-snapshot
Can universally composable cryptographic protocols be practical?
inferred← citeshttps://doi.org/10.70675/223d482az59cbz4318zb326ze21ac47040d4openalex-snapshot
Advanced password-authenticated key exchanges
inferred← citeshttps://doi.org/10.70675/2e1204ecz2b8dz4da9z82f9z82dac54a6d9bopenalex-snapshot
Leaderless state-machine replication : from fail-stop to Byzantine failures
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.