Back to Results
First PageMeta Content
Error detection and correction / Computing / Computer programming / Search algorithms / Treap / Hash tree / Hash function / Binary search tree / Cryptographic hash function / Cryptography / Hashing / Binary trees


Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure Tobias Pulls Roel Peeters
Add to Reading List

Document Date: 2015-01-15 08:57:40

Open Document

File Size: 365,01 KB

Share Result on Facebook

City

Leuven / Karlstad / /

Company

Crosby & Wallach / /

Country

Belgium / /

/

IndustryTerm

unforgeable signature algorithm / verifiable insert algorithms / data processing / verification algorithm / authenticated key-agreement protocol / binary search / transparent key infrastructure / verifiable insert algorithm / randomised binary search tree / event management / level algorithms / binary search tree / /

Person

Balloon / /

Position

author / initially trusted author / clients C. The author / collector / CLIENT-SPECIFIC FORWARD AUTHOR / client/author / auditor / Proving Author / forward-secure author / author / it must follow the protocol / author The author / forward / /

ProvinceOrState

Connecticut / /

Technology

verifiable insert algorithms / verifiable insert algorithm / BuildPrunedTree algorithm / existentially unforgeable MAC algorithm / unforgeable signature algorithm / authenticated key-agreement protocol / verification algorithm / data processor / digital signature / ei Algorithm / following algorithms / IncVerify algorithms / five algorithms / high-level algorithms / /

SocialTag