The following pages link to Bogdan Warinschi (Q421029):
Displaying 45 items.
- Secure proxy signature schemes for delegation of signing rights (Q421030) (← links)
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Multi-key authenticated encryption with corruptions: reductions are lossy (Q1690202) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Generic forward-secure key agreement without signatures (Q2092482) (← links)
- Provable security analysis of FIDO2 (Q2128991) (← links)
- The TLS handshake protocol: A modular analysis (Q2267369) (← links)
- Efficient function-hiding functional encryption: from inner-products to orthogonality (Q2290446) (← links)
- Masking fuzzy-searchable public databases (Q2291409) (← links)
- Cryptographic puzzles and DoS resilience, revisited (Q2510662) (← links)
- On the Hardness of Proving CCA-Security of Signed ElGamal (Q2798771) (← links)
- Selective Opening Security for Receivers (Q2811142) (← links)
- Provably-Secure Remote Memory Attestation for Heap Overflow Protection (Q2827711) (← links)
- A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case (Q2835591) (← links)
- Explicit Randomness is not Necessary when Modeling Probabilistic Encryption (Q2866728) (← links)
- Homomorphic Signatures with Efficient Verification for Polynomial Functions (Q2874515) (← links)
- Efficient Network Coding Signatures in the Standard Model (Q2900252) (← links)
- Adaptive Proofs of Knowledge in the Random Oracle Model (Q2941213) (← links)
- Universally Composable Cryptographic Role-Based Access Control (Q2953848) (← links)
- A linear space algorithm for computing the hermite normal form (Q2958938) (← links)
- Adaptive Pseudo-free Groups and Applications (Q3003384) (← links)
- Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption (Q3184720) (← links)
- Identity Based Group Signatures from Hierarchical Identity-Based Encryption (Q3392909) (← links)
- Security analysis of cryptographically controlled access to XML documents (Q3546366) (← links)
- Groth–Sahai Proofs Revisited (Q3562895) (← links)
- The Fiat–Shamir Transform for Group and Ring Signature Schemes (Q3588353) (← links)
- Get Shorty via Group Signatures without Encryption (Q3588355) (← links)
- A Modular Security Analysis of the TLS Handshake Protocol (Q3600365) (← links)
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness (Q3612566) (← links)
- Hash function requirements for Schnorr signatures (Q3632752) (← links)
- Certified Encryption Revisited (Q3637140) (← links)
- Security Notions and Generic Constructions for Client Puzzles (Q3650711) (← links)
- Foundations of Non-malleable Hash and One-Way Functions (Q3650712) (← links)
- Practical Zero-Knowledge Proofs for Circuit Evaluation (Q3654635) (← links)
- (Q4434902) (← links)
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios (Q4911612) (← links)
- Cryptographic Voting — A Gentle Introduction (Q5253589) (← links)
- Programming Languages and Systems (Q5316562) (← links)
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions (Q5385984) (← links)
- Information and Communications Security (Q5464769) (← links)
- Security in Communication Networks (Q5491695) (← links)
- Automata, Languages and Programming (Q5716817) (← links)
- A Closer Look at PKI: Security and Efficiency (Q5756551) (← links)
- Foundations of Software Science and Computation Structures (Q5899102) (← links)
- Theory of Cryptography (Q5901769) (← links)