Interactive non-malleable codes (Q2175939)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Interactive non-malleable codes	scientific article

Statements

scholarly article

0 references

Interactive non-malleable codes (English)

0 references

Nils Fleischhacker

0 references

0 references

0 references

Anat Paskin-Cherniavsky

0 references

0 references

publication date

30 April 2020

0 references

zbMATH Keywords

interactive non-malleable codes

0 references

lower bounds for threshold tampering functions

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-36033-7_9

0 references

Optimal Computational Split-state Non-malleable Codes

0 references

Non-malleable Reductions and Applications

0 references

Non-malleable codes from additive combinatorics

0 references

Continuous non-malleable codes in the 8-split-state model

0 references

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations

0 references

A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations

0 references

Reliable Communication over Highly Connected Noisy Networks

0 references

Non-malleable codes against bounded polynomial time tampering

0 references

Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits

0 references

Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering

0 references

Non-malleable codes for decision trees

0 references

Secure Computation Without Authentication

0 references

MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS

0 references

Constant-rate coding for multiparty interactive communication is impossible

0 references

0 references

Towards coding for maximum errors in interactive communication

0 references

0 references

0 references

Information-Theoretic Local Non-malleable Codes and Their Applications

0 references

Non-malleable extractors and codes, with their many tampered extensions

0 references

Non-malleable codes and extractors for small-depth circuits, and affine functions

0 references

Capacity of non-malleable codes

0 references

Capacity of Non-Malleable Codes

0 references

Non-Malleable Encryption: Simpler, Shorter, Stronger

0 references

Rate-optimizing compilers for continuously non-malleable codes

0 references

From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes

0 references

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes

0 references

Locally Decodable and Updatable Non-malleable Codes and Their Applications

0 references

Non-malleable extractors and symmetric key cryptography from weak secrets

0 references

Non-malleable Codes from Two-Source Extractors

0 references

Non-Malleable Codes

0 references

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback

0 references

Continuously non-malleable codes with split-state refresh

0 references

Non-malleable codes for space-bounded tampering

0 references

Continuous Non-malleable Codes

0 references

A Tamper and Leakage Resilient von Neumann Architecture

0 references

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

0 references

Optimal Coding for Streaming Authentication and Interactive Communication

0 references

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback

0 references

Towards Optimal Deterministic Coding for Interactive Communication

0 references

0 references

Efficient and Explicit Coding for Interactive Communication

0 references

Efficient Error-Correcting Codes for Sliding Windows

0 references

Optimal error rates for interactive coding I

0 references

Non-malleable secret sharing

0 references

Non-malleable secret sharing for general access structures

0 references

Textbook non-malleable commitments

0 references

Interactive Coding for Multiparty Protocols

0 references

Four-state non-malleable codes with explicit constant rate

0 references

Non-malleable randomness encoders and their applications

0 references

Improved non-malleable extractors, non-malleable codes and independent source extractors

0 references

Tamper and Leakage Resilience in the Split-State Model

0 references

Continuously non-malleable codes in the split-state model from minimal assumptions

0 references

A coding theorem for distributed computation

0 references

0 references

Deterministic coding for interactive communication

0 references

Coding for interactive communication

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-36033-7_9

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:2175939

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