On the public citation graph
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
0 signed · 161 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-34799-2_21openalex-snapshot
Non-Interactive Zero-Knowledge with Preprocessing
inferredcites →https://doi.org/10.1007/0-387-34799-2_3openalex-snapshot
Generalized Secret Sharing and Monotone Functions
inferredcites →https://doi.org/10.1007/0-387-34799-2_4openalex-snapshot
Everything Provable is Provable in Zero-Knowledge
inferredcites →https://doi.org/10.1007/3-540-46766-1_34openalex-snapshot
Efficient Multiparty Protocols Using Circuit Randomization
inferredcites →https://doi.org/10.1007/3-540-46766-1_9openalex-snapshot
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
inferredcites →https://doi.org/10.1007/3-540-47721-7_19openalex-snapshot
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/3-540-48658-5_19openalex-snapshot
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
inferredcites →https://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferredcites →https://doi.org/10.1007/bf00208001openalex-snapshot
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/277697.277716openalex-snapshot
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
inferredcites →https://doi.org/10.2190/4u1d-vqrm-j70d-jeqfopenalex-snapshot
The Effect of Computerized Tests on the Performance and Attitudes of College Students
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10718964_34openalex-snapshot
A Three Phased Schema for Sealed Bid Auction System Design
inferred← citeshttps://doi.org/10.1007/11496137_21openalex-snapshot
OACerts: Oblivious Attribute Certificates
inferred← citeshttps://doi.org/10.1007/11507840_13openalex-snapshot
Testing Disjointness of Private Datasets
inferred← citeshttps://doi.org/10.1007/11745853_3openalex-snapshot
Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/11767480_33openalex-snapshot
Syntax-Driven Private Evaluation of Quantified Membership Queries
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_13openalex-snapshot
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_8openalex-snapshot
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_25openalex-snapshot
Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_18openalex-snapshot
Multiparty Computation from Threshold Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_16openalex-snapshot
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_22openalex-snapshot
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_30openalex-snapshot
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_24openalex-snapshot
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_37openalex-snapshot
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_17openalex-snapshot
Homomorphic Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_7openalex-snapshot
Adaptive Security for Threshold Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_8openalex-snapshot
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_2openalex-snapshot
Introduction to Secure Computation
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_3openalex-snapshot
Commitment Schemes and Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_10openalex-snapshot
Divertible Zero-Knowledge Proof of Polynomial Relations and Blind Group Signature
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_2openalex-snapshot
Multiparty Computation, an Introduction
inferred← citeshttps://doi.org/10.1007/978-0-387-35515-3_46openalex-snapshot
Electronic Payment Systems with Fair On-line Verification
inferred← citeshttps://doi.org/10.1007/978-1-4614-9242-9_8openalex-snapshot
Practical Distributed Privacy-Preserving Data Analysis at Large Scale
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_20openalex-snapshot
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
inferred← citeshttps://doi.org/10.1007/978-3-030-17253-4_13openalex-snapshot
Publicly Verifiable Proofs from Blockchains
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_4openalex-snapshot
Aurora: Transparent Succinct Arguments for R1CS
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_24openalex-snapshot
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-33716-2_11openalex-snapshot
emmy – Trust-Enhancing Authentication Library
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_26openalex-snapshot
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
inferred← citeshttps://doi.org/10.1007/978-3-030-51280-4_23openalex-snapshot
Zether: Towards Privacy in a Smart Contract World
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_25openalex-snapshot
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_7openalex-snapshot
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_18openalex-snapshot
Zero-Knowledge Proofs for Committed Symmetric Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_3openalex-snapshot
Compressing Proofs of k-Out-Of-n Partial Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_4openalex-snapshot
$$\mathsf {Mac'n'Cheese}$$: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_18openalex-snapshot
Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_16openalex-snapshot
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions.
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-22318-1_7openalex-snapshot
Vector Commitments over Rings and Compressed $$\varSigma $$-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-35535-6_5openalex-snapshot
Challenges and Opportunities Associated with Homomorphic Encryption for Financial Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_5openalex-snapshot
Rogue-Instance Security for Batch Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_11openalex-snapshot
HyperNova: Recursive Arguments for Customizable Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-78020-2_13openalex-snapshot
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking
inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_20openalex-snapshot
Random Variable Commitments for Any Sampleable Distribution, and a Certified Laplace Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-319-02937-5_4openalex-snapshot
Zero Knowledge Proofs from Ring-LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-24174-6_16openalex-snapshot
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-43005-8_1openalex-snapshot
Efficient Zero-Knowledge Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66402-6_13openalex-snapshot
Non-interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_12openalex-snapshot
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_18openalex-snapshot
Compact Zero-Knowledge Proofs of Small Hamming Weight
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_19openalex-snapshot
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_23openalex-snapshot
On Simulation-Sound Trapdoor Commitments
inferred← citeshttps://doi.org/10.1007/978-3-540-30580-4_11openalex-snapshot
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_24openalex-snapshot
Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-47942-0_9openalex-snapshot
Zero-Knowledge Proofs of Possession of Digital Signatures and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_17openalex-snapshot
How to Prove That a Committed Number Is Prime
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_23openalex-snapshot
Secure Computation of the Vector Dominance Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_22openalex-snapshot
Verifiable Rotation of Homomorphic Encryptions
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_28openalex-snapshot
Practical Zero-Knowledge Proofs for Circuit Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-12980-3_3openalex-snapshot
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_30openalex-snapshot
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-17955-6_4openalex-snapshot
Distributed Paillier Cryptosystem without Trusted Dealer
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-32284-6_4openalex-snapshot
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_31openalex-snapshot
Zero-Knowledge Proofs via Polynomial Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_40openalex-snapshot
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_38openalex-snapshot
Algebraic (Trapdoor) One-Way Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_38openalex-snapshot
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
inferred← citeshttps://doi.org/10.1007/978-3-642-38553-7_5openalex-snapshot
Brandt’s Fully Private Auction Protocol Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_9openalex-snapshot
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_5openalex-snapshot
Improved OR-Composition of Sigma-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_12openalex-snapshot
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_3openalex-snapshot
Online/Offline OR Composition of Sigma Protocols
inferred← citeshttps://doi.org/10.1007/978-981-15-0361-0_15openalex-snapshot
Efficient Entity Authentication Using Modified Guillou–Quisquater Zero-Knowledge Protocol
inferred← citeshttps://doi.org/10.1007/978-981-19-8877-6_5openalex-snapshot
Overview of Zero-Knowledge Proof and Its Applications in Blockchain
inferred← citeshttps://doi.org/10.1007/978-981-96-0935-2_11openalex-snapshot
Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation
inferred← citeshttps://doi.org/10.1007/bfb0055715openalex-snapshot
Advances in Cryptology — CRYPTO '98
inferred← citeshttps://doi.org/10.1007/s00145-025-09569-yopenalex-snapshot
The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs
inferred← citeshttps://doi.org/10.1007/s001450010011openalex-snapshot
Short Non-Interactive Cryptographic Proofs
inferred← citeshttps://doi.org/10.1007/s10994-022-06267-9openalex-snapshot
An accurate, scalable and verifiable protocol for federated differentially private averaging
inferred← citeshttps://doi.org/10.1007/s11704-011-9307-7openalex-snapshot
Resolving conflicts between negotiation success and sensitive information protection in automated trust negotiation
inferred← citeshttps://doi.org/10.1007/s12204-008-0574-xopenalex-snapshot
Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jiixd.2026.07.005openalex-snapshot
Zero-knowledge-proof-based blockchain-enabled personal credit scoring with SHAP explainability
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.029openalex-snapshot
Algebraic (trapdoor) one-way functions: Constructions and applications
inferred← citeshttps://doi.org/10.1109/access.2020.3046025openalex-snapshot
Non-Interactive Zero-Knowledge for Blockchain: A Survey
inferred← citeshttps://doi.org/10.1109/acsac.2000.898883openalex-snapshot
Introducing decryption authority into PKI
inferred← citeshttps://doi.org/10.1109/colcom.2006.361848openalex-snapshot
Secure and Private Collaborative Linear Programming
inferred← citeshttps://doi.org/10.1109/grc.2006.1635903openalex-snapshot
Zero-knowledge test of vector equivalence granulation of user data with privacy
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.228openalex-snapshot
A Distributed Privacy-Aware Architecture for Communication in Smart Grids
inferred← citeshttps://doi.org/10.1109/iccs56273.2022.9988316openalex-snapshot
A Covert Communication Method Combining Secret Sharing and Steganography
inferred← citeshttps://doi.org/10.1109/icebe.2006.53openalex-snapshot
From Commodity to Value: A Privacy-Preserving e-Business Architecture
inferred← citeshttps://doi.org/10.1109/pcthealth.2006.361626openalex-snapshot
Privacy Preserving Trust Negotiation for Pervasive Healthcare
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004361openalex-snapshot
Collaborative filtering with privacy
inferred← citeshttps://doi.org/10.1109/sp.2018.00020openalex-snapshot
Bulletproofs: Short Proofs for Confidential Transactions and More
inferred← citeshttps://doi.org/10.1109/sp.2018.00060openalex-snapshot
Doubly-Efficient zkSNARKs Without Trusted Setup
inferred← citeshttps://doi.org/10.1109/sp40000.2020.00052openalex-snapshot
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00182openalex-snapshot
Vega: Low-Latency Zero-Knowledge Proofs over Existing Credentials
inferred← citeshttps://doi.org/10.1109/tdsc.2006.54openalex-snapshot
OACerts: Oblivious Attribute Certificates
inferred← citeshttps://doi.org/10.1109/tdsc.2020.2969418openalex-snapshot
An Efficient NIZK Scheme for Privacy-Preserving Transactions Over Account-Model Blockchain
inferred← citeshttps://doi.org/10.1109/tdsc.2022.3179913openalex-snapshot
SymmeProof: Compact Zero-Knowledge Argument for Blockchain Confidential Transactions
inferred← citeshttps://doi.org/10.1109/tpds.2021.3068195openalex-snapshot
VeriML: Enabling Integrity Assurances and Fair Payments for Machine Learning as a Service
inferred← citeshttps://doi.org/10.1109/trustcom56396.2022.00064openalex-snapshot
Improved Zero-Knowledge Proofs for Commitments from Learning Parity with Noise
inferred← citeshttps://doi.org/10.1137/080725398openalex-snapshot
Zero-Knowledge Proofs from Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1137/1.9781611972788.24openalex-snapshot
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
inferred← citeshttps://doi.org/10.1145/1073814.1073819openalex-snapshot
Policy-hiding access control in open environment
inferred← citeshttps://doi.org/10.1145/1102120.1102129openalex-snapshot
Automated trust negotiation using cryptographic credentials
inferred← citeshttps://doi.org/10.1145/1250790.1250794openalex-snapshot
Zero-knowledge from secure multiparty computation
inferred← citeshttps://doi.org/10.1145/1281100.1281155openalex-snapshot
Practical private computation of vector addition-based functions
inferred← citeshttps://doi.org/10.1145/1609956.1609958openalex-snapshot
Automated trust negotiation using cryptographic credentials
inferred← citeshttps://doi.org/10.1145/2508859.2516680openalex-snapshot
Ensuring high-quality randomness in cryptographic key generation
inferred← citeshttps://doi.org/10.1145/2659651.2659678openalex-snapshot
An Order Preserving Encryption Scheme for Cloud Computing
inferred← citeshttps://doi.org/10.1145/3319535.3354251openalex-snapshot
Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited
inferred← citeshttps://doi.org/10.1155/2007/13801openalex-snapshot
A Survey of Homomorphic Encryption for Nonspecialists
inferred← citeshttps://doi.org/10.1186/s42400-025-00395-0openalex-snapshot
A ZK-based multi-blockchain transaction layer for minimal trust base
inferred← citeshttps://doi.org/10.1504/ijeb.2011.045291openalex-snapshot
Managing e-contracts in a supply chain
inferred← citeshttps://doi.org/10.1587/transinf.2023edp7043openalex-snapshot
ZGridBC: Zero-Knowledge Proof Based Scalable and Privacy-Enhanced Blockchain Platform for Electricity Tracking
inferred← citeshttps://doi.org/10.3233/jcs-150535openalex-snapshot
Brandt’s fully private auction protocol revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1704.02086openalex-snapshot
A Zero Knowledge Sumcheck and its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2007.02234openalex-snapshot
Octopus: Privacy-Preserving Collaborative Evaluation of Loan Stacking
inferred← citeshttps://doi.org/10.5120/17612-8399openalex-snapshot
Survey on End-to-End Verifiable Cryptographic Voting Systems
inferred← citeshttps://doi.org/10.5281/zenodo.7876012openalex-snapshot
Private Sampling with Identifiable Cheaters
inferred← citeshttps://doi.org/10.56553/popets-2023-0058openalex-snapshot
Private Sampling with Identifiable Cheaters
inferred← citeshttps://doi.org/10.5772/56687openalex-snapshot
Homomorphic Encryption — Theory and Application
inferred← citeshttps://doi.org/10.70675/90507331z61c5z4378zb146z0dca82ef4571openalex-snapshot
Functional encryption and distributed signatures based on projective hash functions, the benefit of class groups
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/eddd8ffazdcb3z4837z8bf7z30902ba105e6openalex-snapshot
Integrity, authentication and confidentiality in public-key cryptography
inferred← citeshttps://doi.org/10.7146/brics.v4i27.18953openalex-snapshot
Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
inferred← citeshttps://doi.org/10.7146/brics.v4i28.18954openalex-snapshot
Span Programs and General Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.7146/brics.v4i29.18955openalex-snapshot
Model Checking via Reachability Testing for Timed Automata
inferred← citeshttps://doi.org/10.7146/brics.v4i34.18960openalex-snapshot
Presheaf Models for the pi-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v4i35.18961openalex-snapshot
A Theory of Recursive Domains with Applications to Concurrency
inferred← citeshttps://doi.org/10.7146/brics.v4i36.18962openalex-snapshot
Relational Semantics of Non-Deterministic Dataflow
inferred← citeshttps://doi.org/10.7146/brics.v5i32.19438openalex-snapshot
Verifiable Encryption and Applications to Group Signatures and Signature Sharing
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.