On the public citation graph

On the existence of 3-round zero-knowledge protocols

https://doi.org/10.1007/bfb0055744
0 signed · 158 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.
Claim with ORCID
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.
See reference health

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_46openalex-snapshot
Zero Knowledge Proofs of Knowledge in Two Rounds
inferredcites →https://doi.org/10.1007/3-540-46766-1_36openalex-snapshot
Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
inferredcites →https://doi.org/10.1007/3-540-46885-4_21openalex-snapshot
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
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-69053-0_20openalex-snapshot
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/bf00208001openalex-snapshot
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1007/bf02620230openalex-snapshot
A uniform-complexity treatment of encryption and zero-knowledge
inferredcites →https://doi.org/10.1007/bfb0035756openalex-snapshot
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0304-3975(94)90237-2openalex-snapshot
The knowledge complexity of quadratic residuosity languages
inferredcites →https://doi.org/10.1109/sfcs.1986.33openalex-snapshot
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
inferredcites →https://doi.org/10.1109/sfcs.1987.49openalex-snapshot
Random self-reducibility and zero knowledge interactive proofs of possession of information
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
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/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/100216.100283openalex-snapshot
Perfect zero-knowledge in constant rounds
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/168588.168596openalex-snapshot
Random oracles are practical
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11496137_33openalex-snapshot
Short Signature and Universal Designated Verifier Signature Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11535218_33openalex-snapshot
HMQV: A High-Performance Secure Diffie-Hellman Protocol
inferred← citeshttps://doi.org/10.1007/11605805_10openalex-snapshot
A New Security Proof for Damgård’s ElGamal
inferred← citeshttps://doi.org/10.1007/11761679_18openalex-snapshot
The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
inferred← citeshttps://doi.org/10.1007/11832072_5openalex-snapshot
Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_34openalex-snapshot
Zero-Knowledge and Code Obfuscation
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_35openalex-snapshot
A Note on Security Proofs in the Generic Model
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_28openalex-snapshot
A Note on the Round-Complexity of Concurrent Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_12openalex-snapshot
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_7openalex-snapshot
A Relationship between One-Wayness and Correlation Intractability
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-34618-8_5openalex-snapshot
Non-Committing Encryption with Quasi-Optimal Ciphertext-Rate Based on the DDH Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-45374-9_16openalex-snapshot
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_21openalex-snapshot
Linearly-Homomorphic Signatures and Scalable Mix-Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_4openalex-snapshot
On Instantiating the Algebraic Group Model from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-57808-4_2openalex-snapshot
Random Walks and Concurrent Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-64375-1_21openalex-snapshot
Weakly Extractable One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-65277-7_24openalex-snapshot
The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_15openalex-snapshot
SimS: A Simplification of SiGamal
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_13openalex-snapshot
Composition with Knowledge Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-90553-8_10openalex-snapshot
Traceable and Verifier-Local Revocable Attribute-Based Signature with Constant Length
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_16openalex-snapshot
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_20openalex-snapshot
Impossibilities in Succinct Arguments: Black-Box Extraction and More
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_3openalex-snapshot
R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-26734-4_2openalex-snapshot
On New Variants of FuncCPA Security and Related CCA-Secure Constructions
inferred← citeshttps://doi.org/10.1007/978-3-319-03491-1_2openalex-snapshot
The PACE|CA Protocol for Machine Readable Travel Documents
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_5openalex-snapshot
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-13257-0_8openalex-snapshot
Obfuscation-Based Non-Black-Box Extraction and Constant-Round Zero-Knowledge Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-16745-9_8openalex-snapshot
Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-17470-9_4openalex-snapshot
On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-19962-7_15openalex-snapshot
Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-22425-1_10openalex-snapshot
Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model
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-63715-0_8openalex-snapshot
From Obfuscation to the Security of Fiat-Shamir for Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_21openalex-snapshot
On Secure Two-Party Computation in Three Rounds
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_11openalex-snapshot
Subversion-Zero-Knowledge SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_12openalex-snapshot
Interactively Secure Groups from Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_1openalex-snapshot
On the Existence of Three Round Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_8openalex-snapshot
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_17openalex-snapshot
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_21openalex-snapshot
Round-Optimal Secure Two-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_4openalex-snapshot
Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_6openalex-snapshot
On Cryptographic Assumptions and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_21openalex-snapshot
Succinct NP Proofs from an Extractability Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_37openalex-snapshot
Extractable Perfectly One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_7openalex-snapshot
Perfect NIZK with Adaptive Soundness
inferred← citeshttps://doi.org/10.1007/978-3-540-75496-1_22openalex-snapshot
Trapdoor Permutation Polynomials of ℤ/nℤ and Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_5openalex-snapshot
Which Languages Have 4-Round Zero-Knowledge Proofs?
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_5openalex-snapshot
Efficient and Short Certificateless Signature
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_35openalex-snapshot
Towards a Theory of Extractable Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-00862-7_7openalex-snapshot
Statistically Hiding Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-13708-2_19openalex-snapshot
Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
inferred← citeshttps://doi.org/10.1007/978-3-642-13708-2_20openalex-snapshot
Deniable Internet Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-642-14712-8_12openalex-snapshot
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-17499-5_3openalex-snapshot
Identity-Based Key Exchange Protocols without Pairings
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_2openalex-snapshot
Random Oracle Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_34openalex-snapshot
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_11openalex-snapshot
Point Obfuscation and 3-Round Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_4openalex-snapshot
Secure Two-Party Computation with Low Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_19openalex-snapshot
Group to Group Commitments Do Not Shrink
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_15openalex-snapshot
Secure Database Commitments and Universal Arguments of Quasi Knowledge
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_18openalex-snapshot
Succinct Non-interactive Arguments via Linear Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_37openalex-snapshot
Quadratic Span Programs and Succinct NIZKs without PCPs
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_6openalex-snapshot
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-40576-1_22openalex-snapshot
Short Attribute-Based Group Signature without Random Oracles with Attribute Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-642-41224-0_11openalex-snapshot
Dynamic Attribute Based Group Signature with Attribute Anonymity and Tracing in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_3openalex-snapshot
A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme
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-46803-6_13openalex-snapshot
Cluster Computing in Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_2openalex-snapshot
Fully Structure-Preserving Signatures and Shrinking Commitments
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-48800-3_10openalex-snapshot
Limits of Extractability Assumptions with Distributional Auxiliary Input
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_3openalex-snapshot
3-Message Zero Knowledge Against Human Ignorance
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_5openalex-snapshot
On the (In)Security of SNARKs in the Presence of Oracles
inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_2openalex-snapshot
Interactive Oracle Proofs
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_26openalex-snapshot
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
inferred← citeshttps://doi.org/10.1007/s00145-016-9241-9openalex-snapshot
The Hunting of the SNARK
inferred← citeshttps://doi.org/10.1007/s00145-018-9300-5openalex-snapshot
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
inferred← citeshttps://doi.org/10.1007/s00145-022-09424-4openalex-snapshot
Succinct Non-Interactive Arguments via Linear Interactive Proofs
inferred← citeshttps://doi.org/10.1007/s00145-024-09510-9openalex-snapshot
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
inferred← citeshttps://doi.org/10.1007/s00145-025-09551-8openalex-snapshot
Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
inferred← citeshttps://doi.org/10.1007/s10207-013-0190-0openalex-snapshot
Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts
inferred← citeshttps://doi.org/10.1007/s11227-010-0427-xopenalex-snapshot
Efficient and short certificateless signatures secure against realistic adversaries
inferred← citeshttps://doi.org/10.1007/s11227-015-1556-zopenalex-snapshot
A new publicly verifiable data possession on remote storage
inferred← citeshttps://doi.org/10.1007/s11390-007-9013-yopenalex-snapshot
A New Public-Key Encryption Scheme
inferred← citeshttps://doi.org/10.1007/s11432-008-0013-5openalex-snapshot
Existence of 3-round zero-knowledge proof systems for NP
inferred← citeshttps://doi.org/10.1007/s11432-010-0071-3openalex-snapshot
On constant-round zero-knowledge proofs of knowledge for NP-relations
inferred← citeshttps://doi.org/10.1007/s12204-011-1192-6openalex-snapshot
Certificateless message recovery signatures providing girault’s level-3 security
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.010openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferred← citeshttps://doi.org/10.1080/00207160.2014.948869openalex-snapshot
An efficient certificateless undeniable signature scheme
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.7.1384openalex-snapshot
A Straight-Line Extractable Non-malleable Commitment Scheme
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.9.1949openalex-snapshot
An Identification Scheme with Tight Reduction
inferred← citeshttps://doi.org/10.1109/cec-east.2004.77openalex-snapshot
Zero-knowledge proofs of identity based on ELGAMAL on conic
inferred← citeshttps://doi.org/10.1109/cit.2005.204openalex-snapshot
ZKp based identification protocol on conic curve in distributed environment
inferred← citeshttps://doi.org/10.1109/focs.2007.27openalex-snapshot
Can you beat treewidth?
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/focs.2013.14openalex-snapshot
Constant-Round Concurrent Zero Knowledge from P-Certificates
inferred← citeshttps://doi.org/10.1109/icacci.2013.6637431openalex-snapshot
Provable data possession scheme with constant proof size for outsourced data in public cloud
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959885openalex-snapshot
How to go beyond the black-box simulation barrier
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814626openalex-snapshot
Magic functions
inferred← citeshttps://doi.org/10.1109/tdsc.2006.54openalex-snapshot
OACerts: Oblivious Attribute Certificates
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/20m1319565openalex-snapshot
Weak Zero-Knowledge beyond the Black-Box Barrier
inferred← citeshttps://doi.org/10.1137/s0097539701392949openalex-snapshot
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
inferred← citeshttps://doi.org/10.1145/1102120.1102137openalex-snapshot
New approaches for deniable authentication
inferred← citeshttps://doi.org/10.1145/1180405.1180454openalex-snapshot
Deniable authentication and key exchange
inferred← citeshttps://doi.org/10.1145/1315245.1315318openalex-snapshot
Provable data possession at untrusted stores
inferred← citeshttps://doi.org/10.1145/1952982.1952994openalex-snapshot
Remote data checking using provable data possession
inferred← citeshttps://doi.org/10.1145/1993636.1993651openalex-snapshot
Separating succinct non-interactive arguments from all falsifiable assumptions
inferred← citeshttps://doi.org/10.1145/2090236.2090263openalex-snapshot
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
inferred← citeshttps://doi.org/10.1145/2488608.2488623openalex-snapshot
Recursive composition and bootstrapping for SNARKS and proof-carrying data
inferred← citeshttps://doi.org/10.1145/2488608.2488667openalex-snapshot
Witness encryption and its applications
inferred← citeshttps://doi.org/10.1145/2508859.2516695openalex-snapshot
OAKE
inferred← citeshttps://doi.org/10.1145/2591796.2591859openalex-snapshot
On the existence of extractable one-way functions
inferred← citeshttps://doi.org/10.1145/2976749.2978352openalex-snapshot
Practical Non-Malleable Codes from l-more Extractable Hash Functions
inferred← citeshttps://doi.org/10.1145/3321705.3329826openalex-snapshot
Practical Aggregate Signature from General Elliptic Curves, and Applications to Blockchain
inferred← citeshttps://doi.org/10.1145/380752.380852openalex-snapshot
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
inferred← citeshttps://doi.org/10.1184/r1/6469184openalex-snapshot
Provable Data Possession at Untrusted Stores
inferred← citeshttps://doi.org/10.1504/ijact.2014.062736openalex-snapshot
Dynamic attribute-based group signature with verifier-local revocation and backward unlinkability in the standard model
inferred← citeshttps://doi.org/10.1504/ijics.2014.065162openalex-snapshot
Attribute-based group signature without random oracles with attribute anonymity
inferred← citeshttps://doi.org/10.1515/jmc.2007.010openalex-snapshot
An efficient and secure two-flow zero-knowledge identification protocol
inferred← citeshttps://doi.org/10.1587/transfun.2020cip0002openalex-snapshot
On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question
inferred← citeshttps://doi.org/10.1587/transfun.e101.a.953openalex-snapshot
Two-Round Witness Hiding Protocol
inferred← citeshttps://doi.org/10.26083/tuprints-00004000openalex-snapshot
Cryptographic Reductions: Classification and Applications to Ideal Models
inferred← citeshttps://doi.org/10.4036/iis.2019.r.03openalex-snapshot
On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1105.1071openalex-snapshot
A New Family of Practical Non-Malleable Diffie-Hellman Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3719openalex-snapshot
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
inferred← citeshttps://doi.org/10.5121/csit.2023.131327openalex-snapshot
Efficient Fair and Robust SPDZ-Like Multi-Party Computation
inferred← citeshttps://doi.org/10.62056/anr-zoja5openalex-snapshot
The Uber-Knowledge Assumption: A Bridge to the AGM
inferred← citeshttps://doi.org/10.70675/613f26dez1fcfz4bb3zb710ze245a8b88a2aopenalex-snapshot
Un recueil de SNARKs : sécurité quantique, extractabilité et confidentialité des données
inferred← citeshttps://doi.org/10.70675/ef7e88c9z449ez4649z97d5z0598a59076d7openalex-snapshot
Homomorphic cryptography and privacy
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.