scientific article; zbMATH DE number 1942416
From MaRDI portal
Publication:4409113
Recommendations
- Non-interactive zero knowledge \textit{proofs} in the random oracle model
- Limits of random oracles in secure computation (extended abstract)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- scientific article; zbMATH DE number 2079934
- Random-oracle uninstantiability from indistinguishability obfuscation
- On the power of nonuniformity in proofs of security
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- scientific article; zbMATH DE number 7706036
- scientific article; zbMATH DE number 4191124
- GUC-secure commitments via random oracles: new impossibility and feasibility
Cited in
(96)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Oracles for structural properties: The isomorphism problem and public-key cryptography
- Impossibility of simulation secure functional encryption even with random oracles
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Random oracles and non-uniformity
- The wonderful world of global random oracles
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
- Tightly-secure authenticated key exchange, revisited
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- TARDIS: a foundation of time-lock puzzles in UC
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- On selective-opening security of deterministic primitives
- Handling adaptive compromise for practical encryption schemes
- Overcoming impossibility results in composable security using interval-wise guarantees
- Fully deniable interactive encryption
- Authenticated key exchange and signatures with tight security in the standard model
- A unified and composable take on ratcheting
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Fine-grained forward-secure signature schemes without random oracles
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
- Acyclicity programming for sigma-protocols
- The cost of adaptivity in security games on graphs
- On Adaptively Secure Multiparty Computation with a Short CRS
- The feasibility of outsourced database search in the plain model
- Virtual smart cards: how to sign with a password and a server
- A unified approach to idealized model separations via indistinguishability obfuscation
- Adaptively secure garbled circuits from one-way functions
- Two-message, oblivious evaluation of cryptographic functionalities
- A modular treatment of cryptographic APIs: the symmetric-key case
- Non observability in the random oracle model
- Selective-Opening Security in the Presence of Randomness Failures
- How to Generate and Use Universal Samplers
- A shuffle argument secure in the generic model
- Universally composable cryptographic role-based access control
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- On the power of nonuniformity in proofs of security
- Limits of random oracles in secure computation (extended abstract)
- Designated confirmer signatures with unified verification
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Oracle separation in the non-uniform model
- Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
- Possibility and impossibility results for selective decommitments
- Modeling random oracles under unpredictable queries
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- On the semantic security of functional encryption schemes
- On the connection between leakage tolerance and adaptive security
- Non-adaptive programmability of random oracle
- How to simulate it -- a tutorial on the simulation proof technique
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- A Note on the Instantiability of the Quantum Random Oracle
- A unified framework for non-universal SNARKs
- Efficient one-sided adaptively secure computation
- Fully Anonymous Group Signatures Without Random Oracles
- Completely Non-malleable Encryption Revisited
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- Leaky Random Oracle (Extended Abstract)
- Adaptively secure MPC with sublinear communication complexity
- Bounded Collusion ABE for TMs from IBE
- Proof-carrying data from arithmetized random oracles
- Let attackers program ideal models: modularity and composability for adaptive compromise
- A more complete analysis of the signal double ratchet algorithm
- A random oracle for all of us
- New and improved constructions for partially equivocable public key encryption
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Astrolabous: a universally composable time-lock encryption scheme
- Augmented random oracles
- To label, or not to label (in generic groups)
- A new approach to efficient non-malleable zero-knowledge
- Completeness theorems for adaptively secure broadcast
- Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
- Universally composable auditable surveillance
- Synchronizable fair exchange
- Taming adaptivity in YOSO protocols: the modular way
- CASE: a new frontier in public-key authenticated encryption
- Algebraic group model with oblivious sampling
- Composable oblivious pseudo-random functions via garbled circuits
- SoK: public key encryption with openings
- On deniable authentication against malicious verifiers
- Adaptive security for constrained PRFs
- Non-committing identity based encryption: constructions and applications
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Taming adaptive security and new access structures in evolving secret sharing
- Tweed: adaptively secure lattice-based two-round threshold signatures
- Secure cloud storage: modularization, network adversaries and adaptive corruptions
- The malice of ELFs: practical anamorphic-resistant encryption without random oracles
- Threshold public-key encryption: definitions, relations, and CPA-to-CCA transforms
- Simulatability versus indistinguishability SOA: CCA relations are sampler-dependent
- The random oracle model: a twenty-year retrospective
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 Q4409113)
