On the public citation graph
Statistical zero knowledge protocols to prove modular polynomial relations
0 signed · 431 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-44750-4_35openalex-snapshot
An Efficient Divisible Electronic Cash Scheme
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-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/3-540-49264-x_19openalex-snapshot
Restrictive Binding of Secret-Key Certificates
inferredcites →https://doi.org/10.1007/3-540-68339-9_17openalex-snapshot
Publicly Verifiable Secret Sharing
inferredcites →https://doi.org/10.1007/bf00191356openalex-snapshot
Practical and provably secure release of a secret and exchange of signatures
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
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/sfcs.1987.49openalex-snapshot
Random self-reducibility and zero knowledge interactive proofs of possession of information
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding 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.1617openalex-snapshot
A CRT‐based verifiable secret sharing scheme secure against unbounded adversaries
inferred← citeshttps://doi.org/10.1002/sec.543openalex-snapshot
Introducing proxy zero‐knowledge proof and utilization in anonymous credential systems
inferred← citeshttps://doi.org/10.1007/0-387-33406-8_12openalex-snapshot
Protecting (Anonymous) Credentials with the Trusted Computing Group’s TPM V1.2
inferred← citeshttps://doi.org/10.1007/10719994_19openalex-snapshot
A Security Design for a Wide-Area Distributed System
inferred← citeshttps://doi.org/10.1007/10719994_20openalex-snapshot
Self-Escrowed Public-Key Infrastructures
inferred← citeshttps://doi.org/10.1007/11426639_12openalex-snapshot
Group Signatures with Efficient Concurrent Join
inferred← citeshttps://doi.org/10.1007/11496137_21openalex-snapshot
OACerts: Oblivious Attribute Certificates
inferred← citeshttps://doi.org/10.1007/11496137_26openalex-snapshot
Building Reliable Mix Networks with Fair Exchange
inferred← citeshttps://doi.org/10.1007/11496137_32openalex-snapshot
Non-interactive Zero-Knowledge Arguments for Voting
inferred← citeshttps://doi.org/10.1007/11507840_12openalex-snapshot
A Privacy-Protecting Coupon System
inferred← citeshttps://doi.org/10.1007/11537878_19openalex-snapshot
An Improved Group Signature Scheme
inferred← citeshttps://doi.org/10.1007/11537878_20openalex-snapshot
Efficient Member Revocation in Group Signature Schemes
inferred← citeshttps://doi.org/10.1007/11537878_27openalex-snapshot
A Novel Construction of Two-Party Private Bidding Protocols from Yao’s Millionaires Problem
inferred← citeshttps://doi.org/10.1007/11555827_13openalex-snapshot
Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
inferred← citeshttps://doi.org/10.1007/11593447_15openalex-snapshot
A Sender Verifiable Mix-Net and a New Proof of a Shuffle
inferred← citeshttps://doi.org/10.1007/11605805_11openalex-snapshot
Stand-Alone and Setup-Free Verifiably Committed Signatures
inferred← citeshttps://doi.org/10.1007/11681878_7openalex-snapshot
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
inferred← citeshttps://doi.org/10.1007/11689522_14openalex-snapshot
More on Shared-Scalar-Product Protocols
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/11751595_36openalex-snapshot
Traceable Signature: Better Efficiency and Beyond
inferred← citeshttps://doi.org/10.1007/11761679_31openalex-snapshot
Efficient Binary Conversion for Paillier Encrypted Values
inferred← citeshttps://doi.org/10.1007/11780656_26openalex-snapshot
Oblivious Scalar-Product Protocols
inferred← citeshttps://doi.org/10.1007/11832072_10openalex-snapshot
Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/11889663_25openalex-snapshot
Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination
inferred← citeshttps://doi.org/10.1007/11935070_6openalex-snapshot
Efficient Mutual Data Authentication Using Manually Authenticated Strings
inferred← citeshttps://doi.org/10.1007/11935308_10openalex-snapshot
A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols
inferred← citeshttps://doi.org/10.1007/11935308_17openalex-snapshot
An Anonymous Authentication Scheme for Identification Card
inferred← citeshttps://doi.org/10.1007/11967668_22openalex-snapshot
A Practical and Tightly Secure Signature Scheme Without Hash Function
inferred← citeshttps://doi.org/10.1007/3-540-36159-6_7openalex-snapshot
A Group Signature Scheme Committing the Group
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-36288-6_11openalex-snapshot
A Verifiable Secret Shuffe of Homomorphic Encryptions
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_9openalex-snapshot
The Cramer-Shoup Strong-RSA Signature Scheme Revisited
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_18openalex-snapshot
Forward-Secure Signatures with Fast Key Update
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_20openalex-snapshot
A Signature Scheme with Efficient Protocols
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_16openalex-snapshot
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_20openalex-snapshot
Forward-Secure Signatures with Optimal Signing and Verifying
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_23openalex-snapshot
An Identity Escrow Scheme with Appointed Verifiers
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_8openalex-snapshot
Two-Party Generation of DSA Signatures
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_7openalex-snapshot
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_21openalex-snapshot
On Fair E-cash Systems Based on Group Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45247-8_12openalex-snapshot
Efficient and Secure Member Deletion in Group Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45415-2_2openalex-snapshot
A Fair Electronic Cash Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45472-1_5openalex-snapshot
Blind, Auditable Membership Proofs
inferred← citeshttps://doi.org/10.1007/3-540-45496-9_20openalex-snapshot
Zero-Knowledge Watermark Detection and Proof of Ownership
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_14openalex-snapshot
Computing Inverses over a Shared Secret Modulus
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_31openalex-snapshot
Efficient Proofs that a Committed Number Lies in an Interval
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_26openalex-snapshot
RSA Key Generation with Verifiable Randomness
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_9openalex-snapshot
Client/Server Tradeoffs for Online Elections
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_34openalex-snapshot
Provably Secure air Blind Signatures with Tight Revocation
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_11openalex-snapshot
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_32openalex-snapshot
SiBIR: Signer-Base Intrusion-Resilient Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_5openalex-snapshot
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
inferred← citeshttps://doi.org/10.1007/3-540-45811-5_13openalex-snapshot
A New Offiine Privacy Protecting E-cash System with Revokable Anonymity
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_25openalex-snapshot
The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_27openalex-snapshot
Separability and Efficiency for Generic Group Signature Schemes
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-48970-3_10openalex-snapshot
Divertible Zero-Knowledge Proof of Polynomial Relations and Blind Group Signature
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_19openalex-snapshot
Group Signatures and Their Relevance to Privacy-Protecting Offline Electronic Cash Systems
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_14openalex-snapshot
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_1openalex-snapshot
Efficient Distributed Computation Modulo a Shared Secret
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_4openalex-snapshot
Provable Security for Public Key Schemes
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-0-387-35528-3_15openalex-snapshot
Partial Revelation of Certified Identity
inferred← citeshttps://doi.org/10.1007/978-1-4614-6154-8_52openalex-snapshot
Secure Cosine Similarity Computation with Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_23openalex-snapshot
Proof-of-Stake Protocols for Privacy-Aware Blockchains
inferred← citeshttps://doi.org/10.1007/978-3-030-25283-0_19openalex-snapshot
Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security
inferred← citeshttps://doi.org/10.1007/978-3-030-44223-1_15openalex-snapshot
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_24openalex-snapshot
Transparent SNARKs from DARK Compilers
inferred← citeshttps://doi.org/10.1007/978-3-030-51280-4_24openalex-snapshot
An Airdrop that Preserves Recipient Privacy
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_1openalex-snapshot
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_18openalex-snapshot
Compressed $$\varSigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_26openalex-snapshot
Succinct Diophantine-Satisfiability Arguments
inferred← citeshttps://doi.org/10.1007/978-3-030-70852-8_6openalex-snapshot
Efficient Mixing of Arbitrary Ballots with Everlasting Privacy: How to Verifiably Mix the PPATC Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-77883-5_9openalex-snapshot
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-97121-2_22openalex-snapshot
Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_8openalex-snapshot
Universally Composable $$\varSigma $$-protocols in the Global Random-Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-031-30617-4_20openalex-snapshot
Privacy-Preserving Blueprints
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_18openalex-snapshot
Zero-Knowledge Arguments for Subverted RSA Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-54075-2_2openalex-snapshot
Basic Techniques for Decentralized Privacy Preservation
inferred← citeshttps://doi.org/10.1007/978-3-031-64381-1_4openalex-snapshot
CDLS: Proving Knowledge of Committed Discrete Logarithms with Soundness
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_18openalex-snapshot
DewTwo: A Transparent PCS with Quasi-Linear Prover, Logarithmic Verifier and 4.5KB Proofs from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-25317-0_14openalex-snapshot
Malicious Private Set Union with Two-Sided Output
inferred← citeshttps://doi.org/10.1007/978-3-032-26734-4_12openalex-snapshot
Two-Round 2PC ECDSA at the Cost of 1 OLE: Applications to Embedded Cryptocurrency Wallets
inferred← citeshttps://doi.org/10.1007/978-3-032-26737-5_7openalex-snapshot
General Techniques for Building SNARKs over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-319-08344-5_19openalex-snapshot
On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-12280-9_18openalex-snapshot
Towards a Full-Featured Implementation of Attribute Based Credentials on Smart Cards
inferred← citeshttps://doi.org/10.1007/978-3-319-13257-0_3openalex-snapshot
ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
inferred← citeshttps://doi.org/10.1007/978-3-319-14439-9_3openalex-snapshot
Cryptographic Protocols Underlying Privacy-ABCs
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-24858-5_10openalex-snapshot
Two-Factor Authentication for the Bitcoin Protocol
inferred← citeshttps://doi.org/10.1007/978-3-319-31301-6_1openalex-snapshot
Formal Treatment of Privacy-Enhancing Credential Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-31550-8_12openalex-snapshot
Efficient Implementation of AND, OR and NOT Operators for ABCs
inferred← citeshttps://doi.org/10.1007/978-3-319-39555-5_9openalex-snapshot
Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_22openalex-snapshot
Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_11openalex-snapshot
Removing the Strong RSA Assumption from Arguments over the Integers
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-72089-0_7openalex-snapshot
Catching MPC Cheaters: Identification and Openability
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_14openalex-snapshot
Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli
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-319-76581-5_4openalex-snapshot
Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-76953-0_17openalex-snapshot
Reassessing Security of Randomizable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-93638-3_41openalex-snapshot
Decentralized Blacklistable Anonymous Credentials with Reputation
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_22openalex-snapshot
Non-Interactive Zero-Knowledge Proofs for Composite Statements
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_24openalex-snapshot
Lattice-Based Zero-Knowledge Arguments for Integer Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_8openalex-snapshot
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_17openalex-snapshot
Efficient and Universally Composable Committed Oblivious Transfer and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_28openalex-snapshot
On the Notion of Pseudo-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_18openalex-snapshot
Sealed-Bid Auctions with Efficient Bids
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_3openalex-snapshot
On the Security of a Group Signature Scheme with Forward Security
inferred← citeshttps://doi.org/10.1007/978-3-540-30191-2_36openalex-snapshot
A New Key-Insulated Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_30openalex-snapshot
Separable Linkable Threshold Ring Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_28openalex-snapshot
Further Simplifications in Proactive RSA Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_4openalex-snapshot
Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$
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-30580-4_24openalex-snapshot
Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-30598-9_10openalex-snapshot
Efficient Blind Signatures Without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_7openalex-snapshot
Security Remarks on a Group Signature Scheme with Member Deletion
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_16openalex-snapshot
Accumulating Composites and Improved Group Signing
inferred← citeshttps://doi.org/10.1007/978-3-540-44910-2_9openalex-snapshot
A Fair Off-line Electronic Payment System
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_8openalex-snapshot
Practical Verifiable Encryption and Decryption of Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45203-4_3openalex-snapshot
Anonymity-Enhanced Pseudonym System
inferred← citeshttps://doi.org/10.1007/978-3-540-47942-0_21openalex-snapshot
Efficient Accumulators without Trapdoor Extended Abstract
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-70560-4_15openalex-snapshot
Security Analysis of One Verifiable Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_19openalex-snapshot
Designated Confirmer Signatures Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-71093-6_25openalex-snapshot
Privacy-Enhanced Content Distribution and Charging Scheme Using Group Signature
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_10openalex-snapshot
Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_2openalex-snapshot
A Direct Anonymous Attestation Scheme for Embedded Devices
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_25openalex-snapshot
Verifiable Shuffle of Large Size Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_24openalex-snapshot
Non-interactive Proofs for Integer Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_28openalex-snapshot
Divisible E-Cash Systems Can Be Truly Anonymous
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_6openalex-snapshot
Efficient Two-Party Secure Computation on Committed Inputs
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_17openalex-snapshot
Universal Accumulators with Efficient Nonmembership Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-73458-1_30openalex-snapshot
Efficient and Secure Comparison for On-Line Auctions
inferred← citeshttps://doi.org/10.1007/978-3-540-74124-4_25openalex-snapshot
A Subliminal-Free Variant of ECDSA
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_8openalex-snapshot
Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_18openalex-snapshot
Boudot’s Range-Bounded Commitment Scheme Revisited
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-540-79263-5_19openalex-snapshot
Online/Offline Signature Schemes for Devices with Limited Computing Capabilities
inferred← citeshttps://doi.org/10.1007/978-3-540-79499-8_12openalex-snapshot
Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-540-79966-5_5openalex-snapshot
A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_2openalex-snapshot
Programmable Hash Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-85886-7_3openalex-snapshot
Property-Based Attestation without a Trusted Third Party
inferred← citeshttps://doi.org/10.1007/978-3-540-88269-5_2openalex-snapshot
Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_15openalex-snapshot
Efficient Protocols for Set Membership and Range Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_7openalex-snapshot
An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-89754-5_32openalex-snapshot
A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-92238-4_2openalex-snapshot
The Marriage of Cryptography and Watermarking — Beneficial and Challenging for Secure Watermarking and Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_28openalex-snapshot
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
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-01001-9_2openalex-snapshot
Breaking RSA Generically Is Equivalent to Factoring
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_25openalex-snapshot
On the Portability of Generalized Schnorr Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-02384-2_8openalex-snapshot
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-02620-1_28openalex-snapshot
A Commitment-Consistent Proof of a Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_11openalex-snapshot
On the Amortized Complexity of Zero-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-03549-4_3openalex-snapshot
Privacy-Preserving Information Markets for Computing Statistical Data
inferred← citeshttps://doi.org/10.1007/978-3-642-04846-3_14openalex-snapshot
A Proposal of Efficient Remote Biometric Authentication Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-10433-6_3openalex-snapshot
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_16openalex-snapshot
Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_12openalex-snapshot
Efficient, Robust and Constant-Round Distributed RSA Key Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_33openalex-snapshot
Efficiency Limitations for Σ-Protocols for Group Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_1openalex-snapshot
A New RSA-Based Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_8openalex-snapshot
Batch Range Proof for Practical Small Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-14577-3_32openalex-snapshot
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_12openalex-snapshot
Structure-Preserving Signatures and Commitments to Group Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-14932-0_73openalex-snapshot
A Controllable Anonymous Proxy Signature Scheme with Revocation
inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_10openalex-snapshot
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Σ-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_11openalex-snapshot
A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_5openalex-snapshot
A Framework for Constructing Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_13openalex-snapshot
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
inferred← citeshttps://doi.org/10.1007/978-3-642-18178-8_27openalex-snapshot
A Short Signature Scheme from the RSA Family
inferred← citeshttps://doi.org/10.1007/978-3-642-18178-8_32openalex-snapshot
Efficient Multiplicative Homomorphic E-Voting
inferred← citeshttps://doi.org/10.1007/978-3-642-19074-2_3openalex-snapshot
A General, Flexible and Efficient Proof of Inclusion and Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-642-21554-4_30openalex-snapshot
Secure Authenticated Comparisons
inferred← citeshttps://doi.org/10.1007/978-3-642-22497-3_34openalex-snapshot
Impracticality of Efficient PVSS in Real Life Security Standard (Poster)
inferred← citeshttps://doi.org/10.1007/978-3-642-25283-9_9openalex-snapshot
Revocation of Direct Anonymous Attestation
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-25516-8_26openalex-snapshot
Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
inferred← citeshttps://doi.org/10.1007/978-3-642-27954-6_20openalex-snapshot
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
inferred← citeshttps://doi.org/10.1007/978-3-642-28368-0_25openalex-snapshot
The Challenges Raised by the Privacy-Preserving Identity Card
inferred← citeshttps://doi.org/10.1007/978-3-642-29889-9_2openalex-snapshot
Toward Real-Life Implementation of Signature Schemes from the Strong RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_17openalex-snapshot
How to Fix Two RSA-Based PVSS Schemes—Exploration and Solution
inferred← citeshttps://doi.org/10.1007/978-3-642-31680-7_2openalex-snapshot
Private Client-Side Profiling with Random Forests and Hidden Markov Models
inferred← citeshttps://doi.org/10.1007/978-3-642-31909-9_13openalex-snapshot
Optimistic Fair Exchange of Ring Signatures
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-32284-6_9openalex-snapshot
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-32298-3_12openalex-snapshot
A General, Flexible and Efficient Proof of Inclusion and Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_26openalex-snapshot
Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-32946-3_18openalex-snapshot
Designing Privacy-Preserving Smart Meters with Low-Cost Microcontrollers
inferred← citeshttps://doi.org/10.1007/978-3-642-36213-2_10openalex-snapshot
Bringing Zero-Knowledge Proofs of Knowledge to Practice
showing the first 200 of 416 · page through all 416
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.