On the public citation graph
Smooth Projective Hashing and Two-Message Oblivious Transfer
0 signed · 141 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/0-387-34805-0_48openalex-snapshot
Non-Interactive Oblivious Transfer and Applications
inferredcites →https://doi.org/10.1007/3-540-39200-9_33openalex-snapshot
A Framework for Password-Based Authenticated Key Exchange
inferredcites →https://doi.org/10.1007/3-540-44987-6_29openalex-snapshot
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
inferredcites →https://doi.org/10.1007/3-540-44987-6_8openalex-snapshot
Priced Oblivious Transfer: How to Sell Digital Goods
inferredcites →https://doi.org/10.1007/3-540-46035-7_4openalex-snapshot
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
inferredcites →https://doi.org/10.1007/3-540-48184-2_30openalex-snapshot
Equivalence Between Two Flavours of Oblivious Transfers
inferredcites →https://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_19openalex-snapshot
A Randomized Protocol for Signing Contracts
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_22openalex-snapshot
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_25openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferredcites →https://doi.org/10.1007/bfb0055717openalex-snapshot
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.1998.743500openalex-snapshot
Oblivious transfer with a memory-bounded receiver
inferredcites →https://doi.org/10.1145/62212.62215openalex-snapshot
Founding crytpography on oblivious transfer
inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.5555/365411.365502openalex-snapshot
Efficient oblivious transfer protocols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1285openalex-snapshot
Universally composable issuer‐free adaptive oblivious transfer with access policy
inferred← citeshttps://doi.org/10.1002/sec.1505openalex-snapshot
Efficient oblivious transfer with adaptive queries in UC framework
inferred← citeshttps://doi.org/10.1007/978-3-030-03810-6_14openalex-snapshot
Two-Message Statistically Sender-Private OT from LWE
inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_22openalex-snapshot
Fine-Grained Cryptography Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_21openalex-snapshot
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_5openalex-snapshot
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_4openalex-snapshot
Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_7openalex-snapshot
The Price of Active Security in Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_21openalex-snapshot
Statistical ZAPR Arguments from Bilinear Maps
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_22openalex-snapshot
Statistical ZAP Arguments
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_23openalex-snapshot
Statistical Zaps and New Oblivious Transfer Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_10openalex-snapshot
UC-Secure OT from LWE, Revisited
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-64834-3_13openalex-snapshot
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_7openalex-snapshot
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-030-93206-0_23openalex-snapshot
A Secure and Privacy-Preserving Data Transmission Scheme in the Healthcare Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_2openalex-snapshot
Rate-1 Incompressible Encryption from Standard Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-33488-7_25openalex-snapshot
A Gapless Post-quantum Hash Proof System in the Hamming Metric
inferred← citeshttps://doi.org/10.1007/978-3-031-38557-5_13openalex-snapshot
Round-Optimal Black-Box MPC in the Plain Model
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-48621-0_4openalex-snapshot
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance
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-032-01881-6_16openalex-snapshot
A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-07089-0_2openalex-snapshot
Secure Computation: A Primer
inferred← citeshttps://doi.org/10.1007/978-3-319-12280-9_10openalex-snapshot
Universally Composable Oblivious Transfer Based on a Variant of LPN
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_8openalex-snapshot
Non-Interactive Zero-Knowledge Proofs of Non-Membership
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_4openalex-snapshot
Lossy Projective Hashing and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_4openalex-snapshot
Generic Construction of UC-Secure Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-319-31550-8_4openalex-snapshot
Universally Composable Oblivious Database in the Presence of Malicious Adversaries
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-68637-0_22openalex-snapshot
Public-Key Encryption with Simulation-Based Sender Selective-Opening Security
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_19openalex-snapshot
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_22openalex-snapshot
Hash Proof Systems over Lattices Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_2openalex-snapshot
Statistical Witness Indistinguishability (and more) in Two Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_31openalex-snapshot
Evaluating Branching Programs on Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_8openalex-snapshot
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_33openalex-snapshot
Simulatable Adaptive Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_4openalex-snapshot
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_14openalex-snapshot
A New Protocol for Conditional Disclosure of Secrets and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_24openalex-snapshot
Reducing Trust in the PKG in Identity Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_7openalex-snapshot
Universally-Composable Two-Party Computation in Two Rounds
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_16openalex-snapshot
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-79263-5_4openalex-snapshot
Efficient Fully-Simulatable Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_11openalex-snapshot
Oblivious Transfer Based on the McEliece Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_31openalex-snapshot
A Framework for Efficient and Composable Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_2openalex-snapshot
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_23openalex-snapshot
Round Optimal Universally Composable Oblivious Transfer Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-89994-5_12openalex-snapshot
Coding-Based Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_23openalex-snapshot
Simple, Black-Box Constructions of Adaptively Secure Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-00730-9_20openalex-snapshot
Essentially Optimal Universally Composable Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-02384-2_20openalex-snapshot
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
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-10366-7_20openalex-snapshot
Simple Adaptive Oblivious Transfer without Random Oracle
inferred← citeshttps://doi.org/10.1007/978-3-642-10838-9_11openalex-snapshot
ID-Based Adaptive Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-14303-8_7openalex-snapshot
Oblivious Transfer and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_12openalex-snapshot
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-19050-6_22openalex-snapshot
Requirements for Identity Management from the Perspective of Multilateral Interactions
inferred← citeshttps://doi.org/10.1007/978-3-642-24209-0_25openalex-snapshot
Oblivious Transfer with Complex Attribute-Based Access Control
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_4openalex-snapshot
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_6openalex-snapshot
Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_16openalex-snapshot
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_10openalex-snapshot
A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions
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-30057-8_37openalex-snapshot
Extended-DDH and Lossy Trapdoor Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-32284-6_5openalex-snapshot
Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-32946-3_20openalex-snapshot
Oblivious Decision Programs from Oblivious Transfer: Efficient Reductions
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-46803-6_3openalex-snapshot
Disjunctions for Hash Proof Systems: New Constructions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-53140-2_13openalex-snapshot
Software Implementation of Koblitz Curves over Quadratic Fields
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-53890-6_8openalex-snapshot
Adaptive Oblivious Transfer and Generalization
inferred← citeshttps://doi.org/10.1007/978-981-97-8013-6_6openalex-snapshot
1-Out-of-N Oblivious Transfer from MLWE
inferred← citeshttps://doi.org/10.1007/s00145-009-9040-7openalex-snapshot
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
inferred← citeshttps://doi.org/10.1007/s00145-014-9177-xopenalex-snapshot
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/s00145-021-09390-3openalex-snapshot
Fine-Grained Cryptography Revisited
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/s00200-008-0068-yopenalex-snapshot
In search of mathematical primitives for deriving universal projective hash families
inferred← citeshttps://doi.org/10.1007/s10207-014-0247-8openalex-snapshot
Information-theoretically secure oblivious polynomial evaluation in the commodity-based model
inferred← citeshttps://doi.org/10.1007/s10623-022-01075-7openalex-snapshot
A gapless code-based hash proof system based on RQC and its applications
inferred← citeshttps://doi.org/10.1007/s11432-008-0031-3openalex-snapshot
A new approach for UC security concurrent deniable authentication
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.02.002openalex-snapshot
Communication-efficient distributed oblivious transfer
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.001openalex-snapshot
Adaptive oblivious transfer with access control from lattice assumptions
inferred← citeshttps://doi.org/10.1049/2024/5513292openalex-snapshot
Dual‐Mode Encryption for UC‐Secure String OT from Learning with Errors
inferred← citeshttps://doi.org/10.1109/access.2020.3014165openalex-snapshot
Post-Quantum Universal Composable OT Based on Key Exchange
inferred← citeshttps://doi.org/10.1109/focs.2006.74openalex-snapshot
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP
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/tifs.2012.2184096openalex-snapshot
A Practical Framework for $t$ -Out-of- $n$ Oblivious Transfer With Security Against Covert Adversaries
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.1109/tsc.2021.3100323openalex-snapshot
Smooth Projective Hash Function From Codes and its Applications
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/100790537openalex-snapshot
Black-Box Constructions of Protocols for Secure Computation
inferred← citeshttps://doi.org/10.1137/s0097539704383633openalex-snapshot
Oblivious Polynomial Evaluation
inferred← citeshttps://doi.org/10.1145/1132516.1132531openalex-snapshot
Black-box constructions for secure computation
inferred← citeshttps://doi.org/10.1145/2591796.2591842openalex-snapshot
An almost-optimally fair three-party coin-flipping protocol
inferred← citeshttps://doi.org/10.1145/3338498.3358645openalex-snapshot
Private Set Intersection with Linear Communication from General Assumptions
inferred← citeshttps://doi.org/10.1145/3772274openalex-snapshot
A Survey of Threshold Signatures: NIST Standards, Post-Quantum Cryptography, Exotic Techniques, and Real-World Applications
inferred← citeshttps://doi.org/10.1360/jos182871openalex-snapshot
Universally Composable Security Concurrent Deniable Authentication Based on Witness Indistinguishable
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.567openalex-snapshot
Oblivious Transfer Based on the McEliece Assumptions
inferred← citeshttps://doi.org/10.2478/amcs-2019-0059openalex-snapshot
Password–Authenticated Group Key Establishment from Smooth Projective Hash Functions
inferred← citeshttps://doi.org/10.26512/2010.05.d.6004openalex-snapshot
Protocolos com segurança demonstrável baseados em primitivas criptográficas de chave pública
inferred← citeshttps://doi.org/10.29012/jpc.v1i1.566openalex-snapshot
Secure Multiparty Computation for Privacy-Preserving Data Mining
inferred← citeshttps://doi.org/10.32657/10356/47992openalex-snapshot
A study of private information retrieval and related primitives.
inferred← citeshttps://doi.org/10.48550/arxiv.1005.0043openalex-snapshot
A Framework For Fully-Simulatable $h$-Out-Of-$n$ Oblivious Transfer
inferred← citeshttps://doi.org/10.48550/arxiv.1711.10751openalex-snapshot
UC Secure Issuer-Free Adaptive Oblivious Transfer with Hidden Access Policy
inferred← citeshttps://doi.org/10.48550/arxiv.1805.06589openalex-snapshot
Supersingular Isogeny Oblivious Transfer (SIOT)
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00850openalex-snapshot
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
inferred← citeshttps://doi.org/10.5220/0005962402510258openalex-snapshot
Two Secure Anonymous Proxy-based Data Storages
inferred← citeshttps://doi.org/10.5753/sbseg.2010.20584openalex-snapshot
Oblivious Transfer Based on the McEliece Assumptions with Unconditional Security for the Sender
inferred← citeshttps://doi.org/10.70675/0c533096za799z4dfazbaffzd1909c7e9d91openalex-snapshot
Généralisation des protocoles en cas multi-utilisateurs
inferred← citeshttps://doi.org/10.70675/0c895776zfd2cz454fzb227z357d4d0b0148openalex-snapshot
Contribution à la cryptographie post-quantique basée sur les codes correcteurs d’erreurs en métrique rang : Hash Proof Systems et cryptographie à bas coût
inferred← citeshttps://doi.org/10.70675/3645fe13zea86z4ef6zbc61ze17aede2f764openalex-snapshot
Cryptographie de l'identité
inferred← citeshttps://doi.org/10.70675/6391696bzf2ebz446fz9c24z28b62c6eb790openalex-snapshot
Functional encryption for inner-product evaluations
inferred← citeshttps://doi.org/10.70675/f740b9abzcb5cz4cdaza98az010d964d1400openalex-snapshot
Privacy-preserving cryptography from pairings and lattices
inferred← citeshttps://doi.org/10.7916/d8k64r2wopenalex-snapshot
On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks
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.