Incompressible encodings (Q2096497)

From MaRDI portal

Revision as of 18:34, 30 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	Incompressible encodings	scientific article

Statements

scholarly article

0 references

Incompressible encodings (English)

0 references

0 references

0 references

publication date

9 November 2022

0 references

zbMATH Keywords

common random string model

0 references

random-oracle model

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-56784-2_17

0 references

0 references

Public-Key Encryption in the Bounded-Retrieval Model

0 references

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model

0 references

Learning with Rounding, Revisited

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

Lossy trapdoor permutations with improved lossiness

0 references

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

0 references

Big-Key Symmetric Encryption: Resisting Key Exfiltration

0 references

Verifiable delay functions

0 references

Classical hardness of learning with errors

0 references

Anonymous IBE, leakage resilience and circular security from new assumptions

0 references

Intrusion-Resilient Key Exchange in the Bounded Retrieval Model

0 references

Approximate trapdoors for lattices and smaller hash-and-sign signatures

0 references

Laconic oblivious transfer and its applications

0 references

How to build an ideal cipher: the indifferentiability of the Feistel construction

0 references

Proofs of replicated storage without timing assumptions

0 references

0 references

Theory of Cryptography

0 references

Counterexamples to Hardness Amplification beyond Negligible

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Proofs of Retrievability via Hardness Amplification

0 references

Theory of Cryptography

0 references

Tight proofs of space and replication

0 references

More constructions of lossy and correlation-secure trapdoor functions

0 references

New techniques in replica encodings with client setup

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Separating succinct non-interactive arguments from all falsifiable assumptions

0 references

Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings

0 references

Projection properties of the<i>L</i><sub>2</sub>optimal reduced order model

0 references

A Pseudorandom Generator from any One-way Function

0 references

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

0 references

Parallel Repetition for Leakage Resilience Amplification Revisited

0 references

Instantiability of RSA-OAEP under Chosen-Plaintext Attack

0 references

Straight lines on models of curved surfaces

0 references

Theory of Cryptography

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

Theory of Cryptography

0 references

Lossy trapdoor functions and their applications

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Careful with Composition: Limitations of the Indifferentiability Framework

0 references

Compact Proofs of Retrievability

0 references

Barriers in cryptography with weak, correlated and leaky sources

0 references

The Magic of ELFs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-56784-2_17

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2096497

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