scientific article; zbMATH DE number 1775406
From MaRDI portal
Publication:4542539
Recommendations
Cited in
(only showing first 100 items - show all)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Efficient public key encryption with smallest ciphertext expansion from factoring
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Interactive and probabilistic proof-checking
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- The wonderful world of global random oracles
- On the impossibility of structure-preserving deterministic primitives
- Correcting subverted random oracles
- Signatures from sequential-OR proofs
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical Zaps and new oblivious transfer protocols
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Does Fiat-Shamir require a cryptographic hash function?
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Tightly secure ring signatures in the standard model
- Efficient hybrid encryption from ID-based encryption
- Key establishment à la Merkle in a quantum world
- The magic of ELFs
- Cryptography and algorithmic randomness
- Short signatures from Diffie-Hellman: realizing almost compact public key
- How (not) to design strong-RSA signatures
- A provably secure short signature scheme based on discrete logarithms
- Enhancing the security of perfect blind DL-signatures
- Fine-grained forward-secure signature schemes without random oracles
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
- Generic groups, collision resistance, and ECDSA
- Public key encryption with equality test in the standard model
- Public-key authenticated encryption with keyword search revisited: security model and constructions
- The theory of hash functions and random oracles. An approach to modern cryptography
- Post-quantum verification of Fujisaki-Okamoto
- Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy
- On the correlation intractability of obfuscated pseudorandom functions
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Fiat-Shamir for highly sound protocols is instantiable
- A unified approach to idealized model separations via indistinguishability obfuscation
- Optimal security proofs for signatures from identification schemes
- The Magic of ELFs
- Non observability in the random oracle model
- A strong designated verifier signature scheme tightly related to the LRSW assumption
- Limits on the usefulness of random oracles
- Structure-preserving signatures and commitments to group elements
- Simulation-based secure functional encryption in the random oracle model
- A shuffle argument secure in the generic model
- Provably secure certificateless proxy signature scheme in the standard model
- Random oracles with(out) programmability
- The random oracle methodology, revisited.
- Sub-linear size traceable ring signatures without random oracles
- The GGM construction does NOT yield correlation intractable function ensembles
- Short locally testable codes and proofs
- Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
- From Indifferentiability to Constructive Cryptography (and Back)
- Standard security does not imply indistinguishability under selective opening
- Formal Indistinguishability Extended to the Random Oracle Model
- How Risky Is the Random-Oracle Model?
- On the random oracle hypothesis
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- Security Analysis of the PACE Key-Agreement Protocol
- Random oracle model and analysis of primitives of a cryptographic scheme
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
- A Brief History of Provably-Secure Public-Key Encryption
- Efficient One-Round Key Exchange in the Standard Model
- Asynchronous Multi-Party Computation with Quadratic Communication
- Improved Garbled Circuit: Free XOR Gates and Applications
- Simplified Submission of Inputs to Protocols
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Multi-Identity Single-Key Decryption without Random Oracles
- Multi-identity management for identity-based cryptography
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- A public key cryptosystem based on three new provable problems
- Secure Hash-and-Sign Signatures Without the Random Oracle
- scientific article; zbMATH DE number 1304109 (Why is no real title available?)
- scientific article; zbMATH DE number 1341882 (Why is no real title available?)
- scientific article; zbMATH DE number 708821 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- Randomized quantum oblivious transfer with application in hacker-resistant computation
- Modeling random oracles under unpredictable queries
- Strengthening the known-key security notion for block ciphers
- Concurrent signature without random oracles
- Timed encryption with application to deniable key exchange
- On pseudo-random oracles
- Short locally testable codes and proofs: a survey in two parts
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- scientific article; zbMATH DE number 7075880 (Why is no real title available?)
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle
- Non-adaptive programmability of random oracle
- Secure reliable multicast protocols in a WAN
- Cryptography and cryptographic protocols
- Reset indifferentiability from weakened random oracle salvages one-pass hash functions
- Deterministic random oracles
- Automated Reasoning
- Advances in Cryptology - EUROCRYPT 2004
- Fully Anonymous Group Signatures Without Random Oracles
- On the implementation of huge random objects
- Completely Non-malleable Encryption Revisited
- Security of Digital Signature Schemes in Weakened Random Oracle Models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542539)
