On the public citation graph
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
0 signed · 169 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-39118-5_19openalex-snapshot
Collision Free Hash Functions and Public Key Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-46766-1_38openalex-snapshot
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
inferredcites →https://doi.org/10.1007/3-540-48285-7_23openalex-snapshot
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
inferredcites →https://doi.org/10.1007/3-540-48329-2_22openalex-snapshot
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
inferredcites →https://doi.org/10.1007/3-540-48329-2_9openalex-snapshot
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions
inferredcites →https://doi.org/10.1007/3-540-55210-3_203openalex-snapshot
Secure commitment against a powerful adversary
inferredcites →https://doi.org/10.1007/978-1-4612-4808-8_26openalex-snapshot
Average Case Complete Problems
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_31openalex-snapshot
Fair Games Against an All-Powerful Adversary
inferredcites →https://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00204448openalex-snapshot
A discrete logarithm implementation of perfect zero-knowledge blobs
inferredcites →https://doi.org/10.1007/bf02579323openalex-snapshot
One way functions and pseudorandom generators
inferredcites →https://doi.org/10.1007/bf02620230openalex-snapshot
A uniform-complexity treatment of encryption and zero-knowledge
inferredcites →https://doi.org/10.1007/s001459900012openalex-snapshot
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1090/dimacs/013/09openalex-snapshot
Fair games against an all-powerful adversary
inferredcites →https://doi.org/10.1109/fscs.1990.89550openalex-snapshot
Security preserving amplification of hardness
inferredcites →https://doi.org/10.1109/istcs.1993.253489openalex-snapshot
One-way functions are essential for non-trivial zero-knowledge
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1989.63483openalex-snapshot
One-way functions are essential for complexity based cryptography
inferredcites →https://doi.org/10.1109/sfcs.1997.646126openalex-snapshot
Does parallel repetition lower the error in computationally sound protocols?
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0222069openalex-snapshot
On the Existence of Pseudorandom Generators
inferredcites →https://doi.org/10.1137/s0097539793246689openalex-snapshot
Fault-tolerant Computation in the Full Information Model
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/100216.100270openalex-snapshot
Pseudo-random generators under uniform assumptions
inferredcites →https://doi.org/10.1145/100216.100285openalex-snapshot
The (true) complexity of statistical zero knowledge
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/129712.129782openalex-snapshot
A note on efficient zero-knowledge proofs and arguments (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258635openalex-snapshot
Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way 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/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot
Pseudorandomness and Cryptographic Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.1157394openalex-extracted
Reducing Complexity Assumptions for Statistically-Hiding Commitment*
inferred← citeshttps://doi.org/10.3217/jucs-012-06-0691openalex-extracted
Progress in Quantum Computational Cryptography
inferred← citeshttps://doi.org/10.1007/11426639_4openalex-snapshot
Reducing Complexity Assumptions for Statistically-Hiding Commitment
inferred← citeshttps://doi.org/10.1007/11761679_13openalex-snapshot
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot
Random Selection with an Adversarial Majority
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_9openalex-snapshot
Efficient Oblivious Transfer in the Bounded-Storage Model
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_36openalex-snapshot
Round Efficiency of Multi-party Computation with a Dishonest Majority
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_9openalex-snapshot
Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_4openalex-snapshot
Efficient and Non-interactive Non-malleable Commitment
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_5openalex-snapshot
How to Convert the Flavor of a Quantum Bit Commitment
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_21openalex-snapshot
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_7openalex-snapshot
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_35openalex-snapshot
Auditable, Anonymous Electronic Cash
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_5openalex-snapshot
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_3openalex-snapshot
Commitment Schemes and Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_13openalex-snapshot
Founding Secure Computation on Blockchains
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_28openalex-snapshot
Unifying Computational Entropies via Kullback–Leibler Divergence
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_5openalex-snapshot
On Round Optimal Statistical Zero Knowledge Arguments
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_8openalex-snapshot
Super-Perfect Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_21openalex-snapshot
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_19openalex-snapshot
On Statistical Security in Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_2openalex-snapshot
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_20openalex-snapshot
Quantum Computationally Predicate-Binding Commitments with Application in Quantum Zero-Knowledge Arguments for NP
inferred← citeshttps://doi.org/10.1007/978-3-031-15985-5_2openalex-snapshot
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority
inferred← citeshttps://doi.org/10.1007/978-3-031-20917-8_3openalex-snapshot
More Efficient Verifiable Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_4openalex-snapshot
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_7openalex-snapshot
Statistical Security in Two-Party Computation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_22openalex-snapshot
General Properties of Quantum Bit Commitments (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-031-78017-2_13openalex-snapshot
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-032-06688-6_32openalex-snapshot
Oblivious Transfer and Anonymous Password-Based Authenticated Key Exchange Using PUF
inferred← citeshttps://doi.org/10.1007/978-3-319-57339-7_10openalex-snapshot
Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_17openalex-snapshot
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_6openalex-snapshot
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_11openalex-snapshot
A Note on Constant-Round Zero-Knowledge Proofs for NP
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_25openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_16openalex-snapshot
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_23openalex-snapshot
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_3openalex-snapshot
Long-Term Security and Universal Composability
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_27openalex-snapshot
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
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_23openalex-snapshot
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_25openalex-snapshot
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_6openalex-snapshot
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-79499-8_11openalex-snapshot
Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_3openalex-snapshot
Interactive Hashing: An Information Theoretic Tool (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-642-04846-3_8openalex-snapshot
Reducing Complexity Assumptions for Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_21openalex-snapshot
Anonymous Transactions in Computer Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10230-1_16openalex-snapshot
Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlation
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_18openalex-snapshot
Non-malleable Statistically Hiding Commitment from Any One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-642-10698-9_4openalex-snapshot
Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_24openalex-snapshot
Rationality in the Full-Information Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13869-0_31openalex-snapshot
Oblivious Transfer Based on Physical Unclonable Functions
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-14623-7_10openalex-snapshot
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_27openalex-snapshot
On the Black-Box Complexity of Optimally-Fair Coin Tossing
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_34openalex-snapshot
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_35openalex-snapshot
Towards Non-Black-Box Lower Bounds in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_32openalex-snapshot
Computational Verifiable Secret Sharing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_8openalex-snapshot
Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-28368-0_22openalex-snapshot
SIMPL Systems as a Keyless Cryptographic and Security Primitive
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_41openalex-snapshot
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_15openalex-snapshot
Practical Security Analysis of PUF-Based Two-Player Protocols
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-662-53008-5_14openalex-snapshot
On the Power of Secure Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-981-95-6203-9_1openalex-snapshot
Quantum-Computation Classical-Communication Commitments from SZK-Hardness
inferred← citeshttps://doi.org/10.1007/bf03037308openalex-snapshot
Quantum Bit-commitment for small storage based on quantum one-way permutations
inferred← citeshttps://doi.org/10.1007/s00145-002-0116-xopenalex-snapshot
A Note on Negligible Functions
inferred← citeshttps://doi.org/10.1007/s00145-006-0438-1openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/s00145-007-9012-8openalex-snapshot
Reducing Complexity Assumptions for Statistically-Hiding Commitment
inferred← citeshttps://doi.org/10.1007/s00145-010-9068-8openalex-snapshot
Long-Term Security and Universal Composability
inferred← citeshttps://doi.org/10.1007/s00145-012-9139-0openalex-snapshot
A New Interactive Hashing Theorem
inferred← citeshttps://doi.org/10.1007/s00145-014-9191-zopenalex-snapshot
Concurrent Knowledge Extraction in Public-Key Models
inferred← citeshttps://doi.org/10.1007/s00453-020-00770-yopenalex-snapshot
High Entropy Random Selection Protocols
inferred← citeshttps://doi.org/10.1007/s11128-011-0259-5openalex-snapshot
On the impossibility of non-static quantum bit commitment between two parties
inferred← citeshttps://doi.org/10.1007/s11432-013-5044-xopenalex-snapshot
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
inferred← citeshttps://doi.org/10.1007/s13389-013-0052-8openalex-snapshot
On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols
inferred← citeshttps://doi.org/10.1103/physreva.82.032308openalex-snapshot
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
inferred← citeshttps://doi.org/10.1109/ccc.2010.17openalex-snapshot
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
inferred← citeshttps://doi.org/10.1109/cmc.2010.281openalex-snapshot
Perfect Zero-Knowledge Argument of Knowledge with Negligible Error Probability in Two-Round for NP from Any One-Way Permutation
inferred← citeshttps://doi.org/10.1109/focs.2006.21openalex-snapshot
Concurrent Non-Malleable Zero Knowledge
inferred← citeshttps://doi.org/10.1109/focs.2006.54openalex-snapshot
On the Compressibility of NP Instances and Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/focs.2006.71openalex-snapshot
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
inferred← citeshttps://doi.org/10.1109/focs.2007.4389535openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/focs.2007.7openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/isit.2006.262082openalex-snapshot
On the Oblivious Transfer Capacity of the Erasure Channel
inferred← citeshttps://doi.org/10.1109/isit.2014.6875108openalex-snapshot
Oblivious transfer in the bounded storage model with errors
inferred← citeshttps://doi.org/10.1109/pic.2010.5687591openalex-snapshot
A constant-round perfect parallel coin-tossing protocol
inferred← citeshttps://doi.org/10.1109/sapience.2016.7684134openalex-snapshot
Comparative study of diverse zero-knowledge argument systems
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743500openalex-snapshot
Oblivious transfer with a memory-bounded receiver
inferred← citeshttps://doi.org/10.1109/sfcs.2005.27openalex-snapshot
Concurrent Non-Malleable Commitments
inferred← citeshttps://doi.org/10.1109/sp.2019.00048openalex-snapshot
True2F: Backdoor-Resistant Authentication Tokens
inferred← citeshttps://doi.org/10.1109/tifs.2023.3243495openalex-snapshot
Commitments via Physically Related Functions
inferred← citeshttps://doi.org/10.1109/tit.2015.2450732openalex-snapshot
Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
inferred← citeshttps://doi.org/10.1109/tit.2018.2796128openalex-snapshot
Commitment and Oblivious Transfer in the Bounded Storage Model With Errors
inferred← citeshttps://doi.org/10.1137/050641715openalex-snapshot
The Round Complexity of Two-Party Random Selection
inferred← citeshttps://doi.org/10.1137/060661880openalex-snapshot
Concurrent Nonmalleable Commitments
inferred← citeshttps://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferred← citeshttps://doi.org/10.1137/060671553openalex-snapshot
New and Improved Constructions of Nonmalleable Cryptographic Protocols
inferred← citeshttps://doi.org/10.1137/080725404openalex-snapshot
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
inferred← citeshttps://doi.org/10.1137/130938438openalex-snapshot
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
inferred← citeshttps://doi.org/10.1137/s0097539798346123openalex-snapshot
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
inferred← citeshttps://doi.org/10.1145/1060590.1060641openalex-snapshot
The round complexity of two-party random selection
inferred← citeshttps://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
inferred← citeshttps://doi.org/10.1145/1132516.1132559openalex-snapshot
Zero knowledge with efficient provers
inferred← citeshttps://doi.org/10.1145/1250790.1250792openalex-snapshot
Statistically-hiding commitment from any one-way function
inferred← citeshttps://doi.org/10.1145/1315245.1315268openalex-snapshot
Robust computational secret sharing and a unified account of classical secret-sharing goals
inferred← citeshttps://doi.org/10.1145/1966913.1966977openalex-snapshot
Efficient computational oblivious transfer using interactive hashing
inferred← citeshttps://doi.org/10.1145/2240166.2240176openalex-snapshot
Anonymous transactions in computer networks
inferred← citeshttps://doi.org/10.1145/2399187.2399189openalex-snapshot
Sequential rationality in cryptographic protocols
inferred← citeshttps://doi.org/10.11591/eei.v3i1.186openalex-snapshot
A Genuine Random Sequential Multi-signature Scheme
inferred← citeshttps://doi.org/10.14257/ijsia.2015.9.2.16openalex-snapshot
Research and Improvement of Ordered Multisignature Algorithm in Random Oracle Model
inferred← citeshttps://doi.org/10.2174/1874444301406011038openalex-snapshot
A New Digital Audio Watermarking Algorithm
inferred← citeshttps://doi.org/10.26512/2009.12.tcc.1618openalex-snapshot
Achieving oblivious transfer capacit of generalized erasure channels in the malicious model
inferred← citeshttps://doi.org/10.3390/e23010044openalex-snapshot
Computational Hardness of Collective Coin-Tossing Protocols
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
inferred← citeshttps://doi.org/10.48550/arxiv.1008.3123openalex-snapshot
Sequential Rationality in Cryptographic Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3441openalex-snapshot
Non-Interactive Statistically-Hiding Quantum Bit Commitment from Any Quantum One-Way Function
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607035openalex-snapshot
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
inferred← citeshttps://doi.org/10.7146/brics.v5i37.19442openalex-snapshot
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
inferred← citeshttps://doi.org/10.7146/brics.v7i52.20219openalex-snapshot
How to Convert a Flavor of Quantum Bit Commitment
inferred← citeshttps://doi.org/10.7916/d8k64r2wopenalex-snapshot
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks
inferred← citeshttps://doi.org/10.82308/39079openalex-snapshot
Interactive hashing and reductions between Oblivious Transfer variants
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.