The following pages link to Dominique Unruh (Q391315):
Displaying 46 items.
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Post-quantum security of the sponge construction (Q1644762) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- Generic authenticated key exchange in the quantum random oracle model (Q2055699) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Quantum security proofs using semi-classical oracles (Q2304985) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Security of blind signatures revisited (Q2397446) (← links)
- Post-quantum security of Fiat-Shamir (Q2412868) (← links)
- Post-quantum verification of Fujisaki-Okamoto (Q2692346) (← links)
- Relationships between quantum IND-CPA notions (Q2695636) (← links)
- Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation (Q2802604) (← links)
- Quantum Collision-Resistance of Non-uniformly Distributed Functions (Q2802607) (← links)
- Everlasting Multi-party Computation (Q2849407) (← links)
- Quantum Programs With Classical Output Streams (Q2864174) (← links)
- Quantum Position Verification in the Random Oracle Model (Q2874527) (← links)
- Quantum Proofs of Knowledge (Q2894405) (← links)
- Security of Blind Signatures Revisited (Q2900251) (← links)
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model (Q2948402) (← links)
- Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
- Concurrent Composition in the Bounded Quantum Storage Model (Q3003398) (← links)
- Revocable Quantum Timed-Release Encryption (Q3177755) (← links)
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms (Q3181027) (← links)
- (Q3545325) (← links)
- Universally Composable Quantum Multi-party Computation (Q3563852) (← links)
- Universally Composable Incoercibility (Q3582767) (← links)
- On the (Im-)Possibility of Extending Coin Toss (Q3593114) (← links)
- Long-Term Security and Universal Composability (Q3596373) (← links)
- On the Necessity of Rewinding in Secure Multiparty Computation (Q3596378) (← links)
- Limits of Constructive Security Proofs (Q3600381) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- Random Oracles and Auxiliary Input (Q3612551) (← links)
- Round Optimal Blind Signatures (Q5199217) (← links)
- Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification (Q5326761) (← links)
- Revocable Quantum Timed-Release Encryption (Q5418693) (← links)
- (Q5445491) (← links)
- Towards Key-Dependent Message Security in the Standard Model (Q5458588) (← links)
- Information Security (Q5493163) (← links)
- A Formal Language for Cryptographic Pseudocode (Q5505567) (← links)
- Theory of Cryptography (Q5711669) (← links)
- Computationally Binding Quantum Commitments (Q5739213) (← links)
- How to base security on the perfect/statistical binding property of quantum bit commitment? (Q6602443) (← links)
- Towards compressed permutation oracles (Q6604882) (← links)
- Quantum Hoare logic with ghost variables (Q6654512) (← links)
