The following pages link to M. Bellare (Q171914):
Displaying 50 items.
- How Secure is Deterministic Encryption? (Q2941186) (← links)
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography (Q2941198) (← links)
- Interactive Message-Locked Encryption and Secure Deduplication (Q2941208) (← links)
- Distributed pseudo-random bit generators---a new way to speed-up shared coin tossing (Q2942731) (← links)
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model (Q2948398) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Identity-Based Encryption Secure against Selective Opening Attack (Q3000542) (← links)
- Proving Computational Ability (Q3088170) (← links)
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge (Q3088182) (← links)
- Cryptography Secure against Related-Key Attacks and Tampering (Q3102205) (← links)
- Linearity testing in characteristic two (Q3129465) (← links)
- Identification protocols secure against reset attacks (Q3149676) (← links)
- (Q3202944) (← links)
- On the structure of secret key exchange protocols (Q3210141) (← links)
- (Q3210162) (← links)
- New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs (Q3210163) (← links)
- (Q3374905) (← links)
- (Q3374913) (← links)
- Robust Encryption (Q3408211) (← links)
- Keying Hash Functions for Message Authentication (Q3452335) (← links)
- Breaking and provably repairing the SSH authenticated encryption scheme (Q3546458) (← links)
- Transitive Signatures: New Schemes and Proofs (Q3546553) (← links)
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security (Q3549097) (← links)
- Cryptographic Agility and Its Relation to Circular Encryption (Q3563847) (← links)
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks (Q3582783) (← links)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs (Q3593109) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security (Q3604773) (← links)
- Deterministic and Efficiently Searchable Encryption (Q3612569) (← links)
- Key Insulation and Intrusion Resilience over a Public Channel (Q3623037) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme (Q3627448) (← links)
- Hedged Public-Key Encryption: How to Protect against Bad Randomness (Q3650695) (← links)
- Format-Preserving Encryption (Q3651265) (← links)
- Incremental cryptography and application to virus protection (Q4234050) (← links)
- (Q4234051) (← links)
- (Q4234095) (← links)
- (Q4249318) (← links)
- (Q4249337) (← links)
- (Q4249346) (← links)
- (Q4249641) (← links)
- (Q4249643) (← links)
- (Q4250895) (← links)
- (Q4251022) (← links)
- (Q4252727) (← links)
- (Q4252728) (← links)
- The Complexity of Decision Versus Search (Q4286231) (← links)
- How to sign given any trapdoor permutation (Q4302825) (← links)
