interactive non-malleable codes (tcc 2019)
Published 9 months ago • 25 plays • Length 24:19Download video MP4
Download video MP3
Similar videos
-
27:30
ccs 2016 - practical non-malleable codes from i-more extractable hash functions
-
17:53
non-malleable codes from two-source extractors
-
26:46
black-box non-interactive non-malleable commitments
-
20:22
non malleable codes for space bounded tampering
-
25:14
non-malleable codes against bounded polynomial time tampering
-
3:43
non-malleable codes in the split-state model
-
15:44
class usb has no member named ctrl_req usb host fix bypass a5 devices
-
21:45
coding theory | parity check, repetition code and modular arithmetic
-
13:16
lattices: algorithms, complexity, and cryptography
-
15:38
#5: terminology -- codes, and codings and codeableconcepts (oh my!) -- a guided walk through fhir
-
23:16
non-malleable codes, extractors and secret sharing for interleaved tampering and composition o...
-
23:45
continuously non malleable codes in the split state model from minimal assumptions
-
4:56
continuously non-malleable codes against bounded-depth tampering
-
23:01
non malleable codes for partial functions with manipulation detection
-
25:07
continuous non-malleable codes
-
20:33
non-malleable codes for decision trees
-
21:56
non-malleable codes from average-case hardness: ...
-
59:20
non-malleable codes
-
25:10
continuous non-malleable codes in the 8-split-state model
-
24:59
non-malleable codes for bounded parallel-time tampering
-
18:50
explicit rate-1 non-malleable codes for local tampering
-
23:18
continuous space-bounded non-malleable codes from stronger proofs-of-space