Provably-secure time-bound hierarchical key assignment schemes (Q431793): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-010-9094-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018790170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably-secure time-bound hierarchical key assignment schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keying Hash Functions for Message Authentication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption from the Weil Pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures from the Weil pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a theme by Akl and Taylor: security and tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic key assignment schemes for any access control policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enforcing the security of a time-bound hierarchical key assignment scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Provably-Secure Hierarchical Key Assignment Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions for provably-secure time-bound hierarchical key assignment schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average height of directed column-convex polyominoes having square, hexagonal and triangular cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of security notions for probabilistic private-key encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic cryptographic key assignment scheme in a tree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic constructions of efficient pseudo-random functions / rank
 
Normal rank

Latest revision as of 09:51, 5 July 2024

scientific article
Language Label Description Also known as
English
Provably-secure time-bound hierarchical key assignment schemes
scientific article

    Statements

    Provably-secure time-bound hierarchical key assignment schemes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 July 2012
    0 references
    time-bound hierarchical key assignment scheme
    0 references
    time-dependent encryption keys
    0 references
    temporal constraint
    0 references
    key indistinguishability
    0 references
    key recovery
    0 references
    security against adaptive adversaries
    0 references
    security against static adversaries
    0 references
    symmetric encryption scheme
    0 references
    bilinear maps
    0 references
    access hierarchy
    0 references

    Identifiers