Compact proofs of retrievability (Q2392096)

From MaRDI portal

Revision as of 16:29, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Compact proofs of retrievability	scientific article

Statements

scholarly article

0 references

Compact proofs of retrievability (English)

0 references

0 references

0 references

Journal of Cryptology

0 references

publication date

1 August 2013

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-012-9129-2

0 references

0 references

A linear time erasure-resilient code with nearly optimal recovery

0 references

Proofs of Storage from Homomorphic Identification Protocols

0 references

Pairing-Friendly Elliptic Curves of Prime Order

0 references

Short signatures from the Weil pairing

0 references

0 references

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

0 references

Proofs of Retrievability via Hardness Amplification

0 references

A taxonomy of pairing-friendly elliptic curves

0 references

A Sample of Samplers: A Computational Perspective on Sampling

0 references

An Enciphering Scheme Based on a Card Shuffle

0 references

Tweakable block ciphers

0 references

The complexity of online memory checking

0 references

Efficient dispersal of information for security, load balancing, and fault tolerance

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00145-012-9129-2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2392096

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2392096&oldid=35344188"