Pages that link to "Item:Q5277813"

The following pages link to Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption (Q5277813):

Displaying 8 items.

• State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
• Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
• Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem (Q1996838) (← links)
• The complexity of certain multi-exponentiation techniques in cryptography (Q2499259) (← links)
• Deciding the security of protocols with commuting public key encryption (Q2848035) (← links)
• On Diffie-Hellman Key Agreement with Short Exponents (Q2876913) (← links)
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model (Q3562884) (← links)
• Complexity Measures for Public-Key Cryptosystems (Q3787917) (← links)