Pages that link to "Item:Q882771"

The following pages link to Another look at ``provable security'' (Q882771):

Displaying 21 items.

• Digital signature scheme set in a hidden cyclic group (Q821308) (← links)
• The random oracle model: a twenty-year retrospective (Q887442) (← links)
• Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces (Q1003091) (← links)
• Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
• Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
• A novel version of the hidden logarithm problem for post-quantum signature algorithms (Q2140568) (← links)
• CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
• Device independent quantum key distribution using three-party pseudo-telepathy (Q2179409) (← links)
• Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
• Another Look at Tightness (Q2889878) (← links)
• Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
• Practical significance of security bounds for standardized internally re-keyed block cipher modes (Q3383060) (← links)
• A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups (Q3543408) (← links)
• Another look at non-standard discrete log and Diffie-Hellman problems (Q3612242) (← links)
• Hash function requirements for Schnorr signatures (Q3632752) (← links)
• Building Secure Block Ciphers on Generic Attacks Assumptions (Q3644193) (← links)
• Interpreting Hash Function Security Proofs (Q4933215) (← links)
• Chasing Diagrams in Cryptography (Q5414973) (← links)
• Another look at automated theorem-proving (Q5443571) (← links)
• Signatures with memory-tight security in the quantum random oracle model (Q6637714) (← links)