Author of the publication

A Key Management Method for Cryptographically Enforced Access Control.

, , and . WOSIS, page 9-22. INSTICC Press, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reoptimization of NP-hard Problems.. ETH Zurich, Zürich, Switzerland, (2012)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/72820).New Advances in Reoptimizing the Minimum Steiner Tree Problem., and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 184-197. Springer, (2012)Efficient key management for cryptographically enforced access control., , and . Comput. Stand. Interfaces, 30 (6): 410-417 (2008)The Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers., , and . DBSec, volume 4602 of Lecture Notes in Computer Science, page 95-97. Springer, (2007)Shortest Augmenting Paths for Online Matchings on Trees., , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 59-71. Springer, (2015)A Key Management Method for Cryptographically Enforced Access Control., , and . WOSIS, page 9-22. INSTICC Press, (2007)Dynamic Steiner Tree in Planar Graphs., , , , and . CoRR, (2013)The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree., , , , and . STOC, page 11-20. ACM, (2015)The Shortest Augmenting Paths for Online Matchings on Trees., , , and . CoRR, (2017)New Reoptimization Techniques applied to Steiner Tree Problem., and . Electron. Notes Discret. Math., (2011)