On the public citation graph
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
0 signed · 1192 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_23openalex-snapshot
Cryptanalysis of the Immunized LL Public Key Systems
inferredcites →https://doi.org/10.1007/3-540-46766-1_35openalex-snapshot
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
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-48071-4_20openalex-snapshot
Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks
inferredcites →https://doi.org/10.1007/3-540-48329-2_36openalex-snapshot
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
inferredcites →https://doi.org/10.1007/3-540-68339-9_17openalex-snapshot
Publicly Verifiable Secret Sharing
inferredcites →https://doi.org/10.1007/3-540-68697-5_11openalex-snapshot
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
inferredcites →https://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferredcites →https://doi.org/10.1007/bfb0052256openalex-snapshot
Collision-Resistant hashing: Towards making UOWHFs practical
inferredcites →https://doi.org/10.1007/bfb0054113openalex-snapshot
Securing threshold cryptosystems against chosen ciphertext attack
inferredcites →https://doi.org/10.1007/bfb0054156openalex-snapshot
Optimistic fair exchange of digital signatures
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1109/sfcs.1997.646134openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
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.1145/100216.100273openalex-snapshot
Public-key cryptosystems provably secure against chosen ciphertext attacks
inferredcites →https://doi.org/10.1145/276698.276741openalex-snapshot
The random oracle methodology, revisited (preliminary version)
inferredcites →https://doi.org/10.1145/276698.276854openalex-snapshot
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781394188369.ch1openalex-snapshot
Public‐Key Encryption and Security Notions
inferred← citeshttps://doi.org/10.1002/9781394188369.ch10openalex-snapshot
Password Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1002/cpe.4523openalex-snapshot
Verifiable Chebyshev maps‐based chaotic encryption schemes with outsourcing computations in the cloud/fog scenarios
inferred← citeshttps://doi.org/10.1002/dac.1023openalex-snapshot
Adaptive secure multicast in wireless networks
inferred← citeshttps://doi.org/10.1002/dac.2598openalex-snapshot
Efficient threshold public key encryption with full security based on dual pairing vector spaces
inferred← citeshttps://doi.org/10.1002/dac.3581openalex-snapshot
Continuous leakage–resilient IBE in cloud computing
inferred← citeshttps://doi.org/10.1002/sec.1101openalex-snapshot
Practical key‐dependent message chosen‐ciphertext security based on decisional composite residuosity and quadratic residuosity assumptions
inferred← citeshttps://doi.org/10.1002/sec.1250openalex-snapshot
Vulnerabilities of an ECC-based RFID authentication scheme
inferred← citeshttps://doi.org/10.1002/sec.1309openalex-snapshot
A novel one‐to‐many and many‐to‐one asymmetric encryption model and its algorithms
inferred← citeshttps://doi.org/10.1002/sec.1429openalex-snapshot
Efficient chosen ciphertext secure identity‐based encryption against key leakage attacks
inferred← citeshttps://doi.org/10.1002/sec.1450openalex-snapshot
Towards fair mutual private set intersection with linear complexity
inferred← citeshttps://doi.org/10.1002/sec.1454openalex-snapshot
Stronger public key encryption system withstanding RAM scraper like attacks
inferred← citeshttps://doi.org/10.1002/sec.1529openalex-snapshot
Privacy-preserving grouping proof with key exchange in the multiple-party setting
inferred← citeshttps://doi.org/10.1002/sec.1643openalex-snapshot
CCA2 secure public‐key encryption scheme tolerating continual leakage attacks
inferred← citeshttps://doi.org/10.1002/sec.380openalex-snapshot
An improved discrete logarithm‐based multisignature scheme
inferred← citeshttps://doi.org/10.1002/sec.571openalex-snapshot
Efficient chosen ciphertext secure public‐key encryption under factoring assumption
inferred← citeshttps://doi.org/10.1002/sec.827openalex-snapshot
Generalized (identity‐based) hash proof system and its applications
inferred← citeshttps://doi.org/10.1007/0-387-23483-7_99openalex-snapshot
Decisional Diffie-Hellman Assumption
inferred← citeshttps://doi.org/10.1007/1-4020-7987-7_26openalex-snapshot
A Remedy of Zhu-Lee-Deng’s Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/10718964_5openalex-snapshot
Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption
inferred← citeshttps://doi.org/10.1007/11426639_5openalex-snapshot
Smooth Projective Hashing and Two-Message Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/11426639_8openalex-snapshot
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
inferred← citeshttps://doi.org/10.1007/11496137_1openalex-snapshot
Two-Server Password-Only Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/11496137_18openalex-snapshot
Optimal Asymmetric Encryption and Signature Paddings
inferred← citeshttps://doi.org/10.1007/11507840_31openalex-snapshot
Interactive Diffie-Hellman Assumptions with Applications to Password-Based Authentication
inferred← citeshttps://doi.org/10.1007/11523468_26openalex-snapshot
On Steganographic Chosen Covertext Security
inferred← citeshttps://doi.org/10.1007/11553939_46openalex-snapshot
Secure Password Authentication for Keystroke Dynamics
inferred← citeshttps://doi.org/10.1007/11554578_1openalex-snapshot
Justifying a Dolev-Yao Model Under Active Attacks
inferred← citeshttps://doi.org/10.1007/11554868_15openalex-snapshot
Questionable Encryption and Its Applications
inferred← citeshttps://doi.org/10.1007/11555827_22openalex-snapshot
Soundness of Formal Encryption in the Presence of Key-Cycles
inferred← citeshttps://doi.org/10.1007/11586821_27openalex-snapshot
A Key Encapsulation Mechanism for NTRU
inferred← citeshttps://doi.org/10.1007/11593447_16openalex-snapshot
Universally Anonymizable Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/11593447_36openalex-snapshot
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/11602897_4openalex-snapshot
Generic, Optimistic, and Efficient Schemes for Fair Certified Email Delivery
inferred← citeshttps://doi.org/10.1007/11605805_16openalex-snapshot
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/11617983_3openalex-snapshot
Cryptography Based on Bilinear Maps
inferred← citeshttps://doi.org/10.1007/11681878_1openalex-snapshot
Concurrent Zero Knowledge Without Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/11681878_30openalex-snapshot
Chosen-Ciphertext Security from Tag-Based Encryption
inferred← citeshttps://doi.org/10.1007/11681878_9openalex-snapshot
On Error Correction in the Exponent
inferred← citeshttps://doi.org/10.1007/11745853_18openalex-snapshot
On the Limitations of the Spread of an IBE-to-PKE Transformation
inferred← citeshttps://doi.org/10.1007/11745853_7openalex-snapshot
Encoding-Free ElGamal Encryption Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11751595_33openalex-snapshot
Public Key Encryption with Keyword Search Based on K-Resilient IBE
inferred← citeshttps://doi.org/10.1007/11761679_27openalex-snapshot
Practical Identity-Based Encryption Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11767480_6openalex-snapshot
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
inferred← citeshttps://doi.org/10.1007/11780656_22openalex-snapshot
Efficient Primitives from Exponentiation in ℤ p
inferred← citeshttps://doi.org/10.1007/11787006_21openalex-snapshot
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
inferred← citeshttps://doi.org/10.1007/11799313_21openalex-snapshot
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
inferred← citeshttps://doi.org/10.1007/11807964_37openalex-snapshot
A New Hierarchical ID-Based Cryptosystem and CCA-Secure PKE
inferred← citeshttps://doi.org/10.1007/11818175_16openalex-snapshot
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
inferred← citeshttps://doi.org/10.1007/11839569_43openalex-snapshot
Efficient Signcryption Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11861386_4openalex-snapshot
A Cryptographic Framework for the Controlled Release of Certified Data
inferred← citeshttps://doi.org/10.1007/11908739_21openalex-snapshot
Chosen Ciphertext Security from Identity-Based Encryption Without Strong Condition
inferred← citeshttps://doi.org/10.1007/11908739_22openalex-snapshot
Ciphertext-Auditable Public Key Encryption
inferred← citeshttps://doi.org/10.1007/11915034_68openalex-snapshot
Public-Key Encryption from ID-Based Encryption Without One-Time Signature
inferred← citeshttps://doi.org/10.1007/11935070_1openalex-snapshot
Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems
inferred← citeshttps://doi.org/10.1007/11935070_6openalex-snapshot
Efficient Mutual Data Authentication Using Manually Authenticated Strings
inferred← citeshttps://doi.org/10.1007/11935230_15openalex-snapshot
Relationship Between Standard Model Plaintext Awareness and Message Hiding
inferred← citeshttps://doi.org/10.1007/11935230_22openalex-snapshot
A Scalable Password-Based Group Key Exchange Protocol in the Standard Model
inferred← citeshttps://doi.org/10.1007/11937807_10openalex-snapshot
Efficient Short Signcryption Scheme with Public Verifiability
inferred← citeshttps://doi.org/10.1007/11941378_13openalex-snapshot
Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
inferred← citeshttps://doi.org/10.1007/11941378_27openalex-snapshot
Secure Cryptographic Workflow in the Standard Model
inferred← citeshttps://doi.org/10.1007/11961635_21openalex-snapshot
An Efficient Public Key Cryptosystem Secure Against Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/3-540-36159-6_6openalex-snapshot
Robust Key-Evolving Public Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_2openalex-snapshot
A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
inferred← citeshttps://doi.org/10.1007/3-540-36231-2_29openalex-snapshot
The Security of a Mix-Center Based on a Semantically Secure Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_21openalex-snapshot
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_4openalex-snapshot
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_6openalex-snapshot
Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_7openalex-snapshot
Randomness Re-use in Multi-recipient Encryption Schemeas
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_8openalex-snapshot
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_24openalex-snapshot
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_21openalex-snapshot
The Group Diffie-Hellman Problems
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_59openalex-snapshot
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
inferred← citeshttps://doi.org/10.1007/3-540-36504-4_14openalex-snapshot
Quasi-Efficient Revocation of Group Signatures
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_14openalex-snapshot
Two Birds One Stone: Signcryption Using RSA
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_15openalex-snapshot
Cryptography after the Bubble: How to Make an Impact on the World
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_16openalex-snapshot
Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_17openalex-snapshot
Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_13openalex-snapshot
Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_15openalex-snapshot
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_28openalex-snapshot
Why Provable Security Matters?
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_33openalex-snapshot
A Framework for Password-Based Authenticated Key Exchange
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_13openalex-snapshot
Mix and Match: Secure Function Evaluation via Ciphertexts
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_14openalex-snapshot
A Length-Invariant Hybrid Mix
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-44448-3_7openalex-snapshot
Security of Signed ElGamal Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_16openalex-snapshot
A Design for Modular Exponentiation Coprocessor in Mobile Telecommunication Terminals
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_1openalex-snapshot
On the Security o a Williams Based Public Key Encryption Scheme
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_15openalex-snapshot
Efficient Revocation in Group Signatures
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_16openalex-snapshot
A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_20openalex-snapshot
Equitability in Retroactive Data Confiscation versus Proactive Key Escrow
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_3openalex-snapshot
IND-CCA Public Key Schemes Equivalent to Factoring n =pq
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_6openalex-snapshot
Fast Irreducibility and Subgroup Membership Testing in XTR
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_8openalex-snapshot
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_26openalex-snapshot
Efficient Non-malleable Commitment Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_6openalex-snapshot
Optimistic Fair Secure Computation
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_13openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
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_33openalex-snapshot
Robust Non-interactive Zero Knowledge
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_13openalex-snapshot
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_16openalex-snapshot
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_17openalex-snapshot
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_29openalex-snapshot
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_30openalex-snapshot
Identification Protocols Secure against Reset Attacks
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_4openalex-snapshot
Efficient and Non-interactive Non-malleable Commitment
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_7openalex-snapshot
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_42openalex-snapshot
Extended Notions of Security for Multicast Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_44openalex-snapshot
Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_31openalex-snapshot
Separating Encryption and Key Issuance in Digital Rights Management Systems
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_37openalex-snapshot
A CCA2 Secure Key Encapsulation Scheme Based on 3rd Order Shift Registers
inferred← citeshttps://doi.org/10.1007/3-540-45325-3_11openalex-snapshot
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
inferred← citeshttps://doi.org/10.1007/3-540-45325-3_8openalex-snapshot
The Exact Security of ECIES in the Generic Group Model
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_11openalex-snapshot
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
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-45353-9_13openalex-snapshot
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_16openalex-snapshot
On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC
inferred← citeshttps://doi.org/10.1007/3-540-45450-0_13openalex-snapshot
The Analysis of Zheng-Seberry Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45472-1_1openalex-snapshot
Efficient Trace and Revoke Schemes
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_17openalex-snapshot
Confirmer Signature Schemes Secure against Adaptive Adversaries
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_18openalex-snapshot
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_19openalex-snapshot
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_31openalex-snapshot
An Identification Scheme Provably Secure against Reset Attack
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_38openalex-snapshot
A Public Key Cryptosystem Based On A Subgroup Membership Problem
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_1openalex-snapshot
New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_4openalex-snapshot
Multi-recipient Public-Key Encryption with Shortened Ciphertext
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_6openalex-snapshot
Formal Proofs for the Security of Signcryption
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_21openalex-snapshot
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_23openalex-snapshot
Mutually Independent Commitments
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_3openalex-snapshot
The Modular Inversion Hidden Number Problem
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_33openalex-snapshot
Key-Privacy in Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_10openalex-snapshot
Security Analysis of IKE’s Signature-Based Key-Exchange Protocol
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_31openalex-snapshot
Deniable Ring Authentication
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-45760-7_19openalex-snapshot
Securing “Encryption + Proof of Knowledge” in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_20openalex-snapshot
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture
inferred← citeshttps://doi.org/10.1007/3-540-45811-5_24openalex-snapshot
Conditional Cryptographic Delegation for P2P Data Sharing
inferred← citeshttps://doi.org/10.1007/3-540-45853-0_1openalex-snapshot
Computational Probabilistic Non-interference
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_1openalex-snapshot
Practical Security in Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_6openalex-snapshot
An IND-CCA2 Public-Key Cryptosystem with Fast Decryption
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_8openalex-snapshot
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_4openalex-snapshot
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_5openalex-snapshot
Key-Insulated Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_9openalex-snapshot
How to Fool an Unbounded Adversary with a Short Key
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_34openalex-snapshot
How to Construct Fail-Stop Confirmer Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_73openalex-snapshot
Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_22openalex-snapshot
An Efficient Public Key Traitor Tracing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_33openalex-snapshot
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_34openalex-snapshot
Secure Integration of Asymmetric and Symmetric Encryption Schemes
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_36openalex-snapshot
Oblivious Transfer with Adaptive Queries
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_9openalex-snapshot
Robust Distributed Multiplication without Interaction
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_17openalex-snapshot
New Public Key Cryptosystems Based on the Dependent-RSA Problems
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_6openalex-snapshot
Conditional Oblivious Transfer and Timed-Release Encryption
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_7openalex-snapshot
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_1openalex-snapshot
Practice-Oriented Provable-Security
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_10openalex-snapshot
Unconditional Security in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_12openalex-snapshot
On the Security of an RSA Based Encryption Scheme
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_22openalex-snapshot
Decision Oracles are Equivalent to Matching Oracles
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_5openalex-snapshot
How to Enhance the Security of Public-Key Encryption at Minimum Cost
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_17openalex-snapshot
Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses
inferred← citeshttps://doi.org/10.1007/978-0-387-73821-5_2openalex-snapshot
A Cryptographic Framework for the Controlled Release Of Certified Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_144openalex-snapshot
Cramer–Shoup Public-Key System
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_250openalex-snapshot
Elliptic Curve Public-Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_443openalex-snapshot
Decisional Diffie–Hellman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-02683-7_20openalex-snapshot
Efficient LFSR Based Distance Bounding Protocol for Contactless EMV Payments
inferred← citeshttps://doi.org/10.1007/978-3-030-02683-7_21openalex-snapshot
Performance Evaluation of a Pseudo-Random Number Generator Against Various Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_21openalex-snapshot
Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_25openalex-snapshot
Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_6openalex-snapshot
Understanding and Constructing AKE via Double-Key Key Encapsulation Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_7openalex-snapshot
Identity-Based Encryption Tightly Secure Under Chosen-Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_9openalex-snapshot
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-14234-6_36openalex-snapshot
Privacy-Preserving Remote User Authentication with k-Times Untraceability
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_9openalex-snapshot
Non-interactive Zero Knowledge Proofs in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-17259-6_7openalex-snapshot
Function Private Predicate Encryption for Low Min-Entropy Predicates
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_21openalex-snapshot
Reusable Designated-Verifier NIZKs for all NP from CDH
inferred← citeshttps://doi.org/10.1007/978-3-030-21373-2_18openalex-snapshot
A Practical Group Signatures for Providing Privacy-Preserving Authentication with Revocation
inferred← citeshttps://doi.org/10.1007/978-3-030-23499-7_6openalex-snapshot
Transitive Pseudonyms Mediated EHRs Sharing for Very Important Patients
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_27openalex-snapshot
The Distinction Between Fixed and Random Generators in Group-Based Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_22openalex-snapshot
New Constructions of Reusable Designated-Verifier NIZKs
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_7openalex-snapshot
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
inferred← citeshttps://doi.org/10.1007/978-3-030-29962-0_6openalex-snapshot
Identity-Based Encryption with Security Against the KGC: A Formal Model and Its Instantiation from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_21openalex-snapshot
The Local Forking Lemma and Its Application to Deterministic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-35199-1_6openalex-snapshot
Efficient Fully Secure Leakage-Deterring Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_11openalex-snapshot
General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_23openalex-snapshot
Policy-Based Sanitizable Signatures
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_6openalex-snapshot
Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512
showing the first 200 of 1170 · page through all 1170
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.