On the public citation graph
Bounded-concurrent secure multi-party computation with a dishonest majority
0 signed · 174 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/3-540-36108-1_2openalex-snapshot
Secure Computation without Agreement
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_36openalex-snapshot
Round Efficiency of Multi-party Computation with a Dishonest Majority
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-45539-6_30openalex-snapshot
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
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/978-3-540-45146-4_19openalex-snapshot
On Deniability in the Common Reference String and Random Oracle Model
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/ccc.2002.1004355openalex-snapshot
Universal Arguments and their Applications
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.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.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/s0097539701392949openalex-snapshot
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/100216.100287openalex-snapshot
The round complexity of secure protocols
inferredcites →https://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
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/335305.335334openalex-snapshot
Resettable zero-knowledge (extended abstract)
inferredcites →https://doi.org/10.1145/41840.41862openalex-snapshot
Achieving independence in logarithmic number of 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/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
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/11535218_22openalex-snapshot
Secure Computation Without Authentication
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/11753728_1openalex-snapshot
Non-black-box Techniques in Cryptography
inferred← citeshttps://doi.org/10.1007/11818175_29openalex-snapshot
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_20openalex-snapshot
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_30openalex-snapshot
The Round Complexity of Secure Computation Against Covert Adversaries
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-64378-2_11openalex-snapshot
Round Optimal Secure Multiparty Computation from Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_14openalex-snapshot
Secure Massively Parallel Computation for Dishonest Majority
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_16openalex-snapshot
Post-Quantum Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_13openalex-snapshot
On the Concurrent Composition of Quantum Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_1openalex-snapshot
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_6openalex-snapshot
Blockchains Enable Non-interactive MPC
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_12openalex-snapshot
Round-Optimal Multi-party Computation with Identifiable Abort
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_3openalex-snapshot
Round-Optimal and Communication-Efficient Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_24openalex-snapshot
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_14openalex-snapshot
$$\log ^*$$-Round Game-Theoretically-Fair Leader Election
inferred← citeshttps://doi.org/10.1007/978-3-031-20974-1_1openalex-snapshot
Efficient NIZK Arguments with Straight-Line Simulation and Extraction
inferred← citeshttps://doi.org/10.1007/978-3-031-33491-7_22openalex-snapshot
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem
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-38557-5_15openalex-snapshot
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
inferred← citeshttps://doi.org/10.1007/978-3-031-91092-0_12openalex-snapshot
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-91092-0_13openalex-snapshot
Black-Box Constant-Round Secure 2PC with Succinct Communication
inferred← citeshttps://doi.org/10.1007/978-3-031-95761-1_12openalex-snapshot
Delayed-Input Multi-party 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-01907-3_8openalex-snapshot
Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_2openalex-snapshot
Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_25openalex-snapshot
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
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-56614-6_12openalex-snapshot
Magic Adversaries Versus Individual Reduction: Science Wins Either Way
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-63688-7_16openalex-snapshot
A New Approach to Round-Optimal Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_5openalex-snapshot
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_24openalex-snapshot
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
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-70503-3_5openalex-snapshot
Round Optimal Concurrent Non-malleability from Polynomial Hardness
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_22openalex-snapshot
Efficient Covert Two-Party Computation
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-319-96881-0_16openalex-snapshot
Promise Zero Knowledge and Its Applications to Round Optimal MPC
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_17openalex-snapshot
Round-Optimal Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_12openalex-snapshot
From Fairness to Full Security in Multiparty Computation
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-30598-9_13openalex-snapshot
Identity-Based Zero-Knowledge
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-77050-3_5openalex-snapshot
The Complexity of Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_31openalex-snapshot
Concurrent Non-malleable Commitments from Any One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_17openalex-snapshot
Efficient Two Party and Multi Party Computation Against Covert Adversaries
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-03356-8_31openalex-snapshot
Collusion-Free Multiparty Computation in the Mediated Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_32openalex-snapshot
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_29openalex-snapshot
Protocols for Multiparty Coin Toss with Dishonest Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_31openalex-snapshot
Secure Multiparty Computation with Minimal Interaction
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_19openalex-snapshot
Bringing People of Different Beliefs Together to Do UC
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_16openalex-snapshot
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
inferred← citeshttps://doi.org/10.1007/978-3-642-24316-5_16openalex-snapshot
Universally Composable Private Proximity Testing
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_8openalex-snapshot
Adaptively Secure Multi-Party Computation with Dishonest Majority
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-36362-7_7openalex-snapshot
Cryptography Using Captcha Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_12openalex-snapshot
On the (In)security of Fischlin’s Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_4openalex-snapshot
Concurrent Zero Knowledge in the Bounded Player 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-42033-7_17openalex-snapshot
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_2openalex-snapshot
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model
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-46494-6_4openalex-snapshot
From Weak to Strong Zero-Knowledge and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_8openalex-snapshot
Topology-Hiding Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_25openalex-snapshot
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_14openalex-snapshot
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
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_4openalex-snapshot
Constant-Round MPC with Fairness and Guarantee of Output Delivery
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_12openalex-snapshot
Network-Hiding Communication and Applications to Multi-party Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_10openalex-snapshot
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_13openalex-snapshot
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
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-007-0567-1openalex-snapshot
Concurrent Composition of Secure Protocols in the Timing Model
inferred← citeshttps://doi.org/10.1007/s00145-007-9015-5openalex-snapshot
Lower Bounds and Impossibility Results for Concurrent Self Composition
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-010-9075-9openalex-snapshot
Secure Computation Without Authentication
inferred← citeshttps://doi.org/10.1007/s00145-013-9168-3openalex-snapshot
Protocols for Multiparty Coin Toss with a Dishonest Majority
inferred← citeshttps://doi.org/10.1007/s00145-019-09322-2openalex-snapshot
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
inferred← citeshttps://doi.org/10.1007/s00145-020-09354-zopenalex-snapshot
$${\varvec{1/p}}$$-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds
inferred← citeshttps://doi.org/10.1007/s00145-021-09382-3openalex-snapshot
Round-Optimal Secure Multi-party Computation
inferred← citeshttps://doi.org/10.1007/s00145-021-09415-xopenalex-snapshot
From Fairness to Full Security in Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00145-023-09466-2openalex-snapshot
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
inferred← citeshttps://doi.org/10.1007/s00145-025-09561-6openalex-snapshot
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
inferred← citeshttps://doi.org/10.1007/s10207-006-0001-yopenalex-snapshot
How to obtain full privacy in auctions
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.01.014openalex-snapshot
A survey on trust management for Internet of Things
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.062openalex-snapshot
Private multiparty sampling and approximation of vector combinations
inferred← citeshttps://doi.org/10.1080/23311975.2016.1261526openalex-snapshot
Corporate governance, firm characteristics, external environment and performance of financial institutions in Uganda: A review of literature
inferred← citeshttps://doi.org/10.1080/23311975.2025.2604879openalex-snapshot
The moderation effect of business environment factors on the impact of corporate governance and firm performance: empirical evidence from Middle East region
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.2007.22openalex-snapshot
Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling
inferred← citeshttps://doi.org/10.1109/focs.2007.70openalex-snapshot
Cryptography from Sunspots: How to Use an Imperfect Reference String
inferred← citeshttps://doi.org/10.1109/focs.2009.59openalex-snapshot
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
inferred← citeshttps://doi.org/10.1109/focs.2010.87openalex-snapshot
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
inferred← citeshttps://doi.org/10.1109/focs.2011.74openalex-snapshot
Stateless Cryptographic Protocols
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.14openalex-snapshot
Constant-Round Concurrent Zero Knowledge from P-Certificates
inferred← citeshttps://doi.org/10.1109/focs.2014.13openalex-snapshot
An Algebraic Approach to Non-malleability
inferred← citeshttps://doi.org/10.1109/focs.2016.12openalex-snapshot
Breaking the Three Round Barrier for Non-malleable Commitments
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.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.1109/sp.2015.25openalex-snapshot
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs
inferred← citeshttps://doi.org/10.1137/060661880openalex-snapshot
Concurrent Nonmalleable Commitments
inferred← citeshttps://doi.org/10.1137/1.9781611974782.170openalex-snapshot
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
inferred← citeshttps://doi.org/10.1137/130946083openalex-snapshot
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
inferred← citeshttps://doi.org/10.1137/16m1073595openalex-snapshot
An Algebraic Approach to Nonmalleability
inferred← citeshttps://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic 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/1159892.1159900openalex-snapshot
Secure multiparty computation of approximations
inferred← citeshttps://doi.org/10.1145/1189056.1189074openalex-snapshot
ACM SIGACT news distributed computing column 24
inferred← citeshttps://doi.org/10.1145/1250790.1250793openalex-snapshot
On achieving the "best of both worlds" in secure multiparty computation
inferred← citeshttps://doi.org/10.1145/1536414.1536441openalex-snapshot
A unified framework for concurrent security
inferred← citeshttps://doi.org/10.1145/1536414.1536442openalex-snapshot
Non-malleability amplification
inferred← citeshttps://doi.org/10.1145/1806689.1806717openalex-snapshot
On the round complexity of covert computation
inferred← citeshttps://doi.org/10.1145/1993636.1993729openalex-snapshot
Constant round non-malleable protocols using one way functions
inferred← citeshttps://doi.org/10.1145/1993636.1993730openalex-snapshot
Constant-round non-malleable commitments from any one-way function
inferred← citeshttps://doi.org/10.1145/2488608.2488637openalex-snapshot
Non-black-box simulation in the fully concurrent setting
inferred← citeshttps://doi.org/10.1145/2488608.2488638openalex-snapshot
Non-black-box simulation from one-way functions and applications to resettable security
inferred← citeshttps://doi.org/10.1145/2699446openalex-snapshot
Constant-Round Nonmalleable Commitments from Any One-Way Function
inferred← citeshttps://doi.org/10.1145/2810103.2813721openalex-snapshot
Fast Non-Malleable Commitments
inferred← citeshttps://doi.org/10.1145/3335741.3335765openalex-snapshot
A tutorial on concurrent zero-knowledge
inferred← citeshttps://doi.org/10.1155/2022/1595520openalex-snapshot
Multiparty Strict Coin-Tossing Protocols Based on the Eigenvalue
inferred← citeshttps://doi.org/10.12794/metadc68060openalex-snapshot
Exploring Privacy in Location-based Services Using Cryptographic Protocols
inferred← citeshttps://doi.org/10.21236/ada582583openalex-snapshot
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
inferred← citeshttps://doi.org/10.4236/jsea.2010.37081openalex-snapshot
Secure Multi-Party Proof and its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12904openalex-snapshot
Post-Quantum Multi-Party Computation
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.