Provably Secure Key Assignment Schemes from Factoring

DOI10.1007/978-3-642-22497-3_19MaRDI QIDQ3012996zbMATH OpenOpenAlexFDO

Authors Eduarda S. V. Freire, Kenneth G. Paterson

Publication date 7 July 2011

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22497-3_19

zbMATH Keywords

access controlfactoringgeneral posetkey assignment schemeprovably secure

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient Provably-Secure Hierarchical Key Assignment Schemes
• Efficient provably-secure hierarchical key assignment schemes
• Authenticated key exchange protocols based on factoring assumption
• Provable security for public key schemes
• scientific article; zbMATH DE number 1303131
• Provably secure proxy signature scheme from factorization
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Practical chosen ciphertext secure encryption from factoring

Cited in

(5)

• Supporting dynamic updates in storage clouds with the Akl-Taylor scheme
• On the relations between security notions in hierarchical key assignment schemes for dynamic structures
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Verifiable partial escrow of integer factors.
• Hierarchical key assignment with dynamic read-write privilege enforcement and extended KI-security

This page was built for publication: Provably Secure Key Assignment Schemes from Factoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012996)