Pages that link to "Item:Q3069902"
From MaRDI portal
The following pages link to The random oracle methodology, revisited (Q3069902):
Displaying 50 items.
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Notes on a provably-secure certificate-based encryption against malicious CA attacks (Q2198258) (← links)
- A formal security analysis of the Signal messaging protocol (Q2210444) (← links)
- Public key encryption with equality test from generic assumptions in the random oracle model (Q2215090) (← links)
- Fast, compact, and expressive attribute-based encryption (Q2234469) (← links)
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack (Q2267360) (← links)
- Secure independent-update concise-expression access control for video on demand in cloud (Q2293024) (← links)
- A strong designated verifier proxy re-signature scheme for IoT environments (Q2333880) (← links)
- Cryptography and algorithmic randomness (Q2354584) (← links)
- On the analysis of cryptographic assumptions in the generic ring model (Q2377063) (← links)
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles (Q2377064) (← links)
- TARD: temporary access rights delegation for guest network devices (Q2396819) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption (Q2402372) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← links)
- Second order collision for the 42-step reduced DHA-256 hash function (Q2445246) (← links)
- Certificateless signature scheme with security enhanced in the standard model (Q2448860) (← links)
- Secure identity-based signcryption in the standard model (Q2450504) (← links)
- Sound and complete computational interpretation of symbolic hashes in the standard model (Q2481980) (← links)
- A lattice-based signcryption scheme without random oracles (Q2515427) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice (Q2678984) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security (Q2692340) (← links)
- Hash Functions from Defective Ideal Ciphers (Q2790047) (← links)
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures (Q2794502) (← links)
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models (Q2796117) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Secure ElGamal-Type Cryptosystems Without Message Encoding (Q2803659) (← links)
- Provably-Secure Remote Memory Attestation for Heap Overflow Protection (Q2827711) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- On the Indifferentiability of Fugue and Luffa (Q3011314) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- Adaptively Secure Non-interactive Threshold Cryptosystems (Q3012950) (← links)
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model (Q3013081) (← links)
- HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES (Q3069744) (← links)
- Efficient Identity-Based Signcryption in the Standard Model (Q3092353) (← links)
- The GGM Function Family Is a Weakly One-Way Family of Functions (Q3179353) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model (Q3195263) (← links)
- (Q3384076) (← links)
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles (Q3392898) (← links)
- Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
