The following pages link to M. Bellare (Q171914):
Displaying 50 items.
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- New proofs for NMAC and HMAC: security without collision resistance (Q901373) (← links)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions (Q1021236) (← links)
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer (Q1291806) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme (Q1402372) (← links)
- Ratcheted encryption and key exchange: the security of messaging (Q1675224) (← links)
- Public-key encryption resistant to parameter subversion and its realization from efficiently-embeddable groups (Q1749287) (← links)
- Robust encryption (Q1753165) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- A note on negligible functions (Q1865127) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation (Q1924194) (← links)
- On-line ciphers and the Hash-CBC constructions (Q1928770) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- Security under message-derived keys: signcryption in iMessage (Q2055665) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Incremental cryptography revisited: PRFs, nonces and modular design (Q2152052) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- Efficient schemes for committing authenticated encryption (Q2170073) (← links)
- The local forking lemma and its application to deterministic encryption (Q2178870) (← links)
- Nonces are noticed: AEAD revisited (Q2181852) (← links)
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold (Q2502164) (← links)
- (Q2707428) (← links)
- (Q2707450) (← links)
- (Q2707451) (← links)
- (Q2707452) (← links)
- (Q2724434) (← links)
- The complexity of approximating a nonlinear program (Q2743964) (← links)
- (Q2778863) (← links)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Improved non-approximability results (Q2817610) (← links)
- Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation'' (Q2817678) (← links)
- Hash-Function Based PRFs: AMAC and Its Multi-User Security (Q2820497) (← links)
- Nonce-Based Cryptography: Retaining Security When Randomness Fails (Q2820505) (← links)
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 (Q2835590) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Instantiating Random Oracles via UCEs (Q2849409) (← links)
- Security of Symmetric Encryption against Mass Surveillance (Q2874493) (← links)
- Cryptography from Compression Functions: The UCE Bridge to the ROM (Q2874503) (← links)
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin (Q2876918) (← links)
- Identity-Based (Lossy) Trapdoor Functions and Applications (Q2894410) (← links)
- Standard Security Does Not Imply Security against Selective-Opening (Q2894436) (← links)
- Semantic Security for the Wiretap Channel (Q2914266) (← links)
- Multi-instance Security and Its Application to Password-Based Cryptography (Q2914267) (← links)
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation (Q2936603) (← links)
