Non-malleable codes for bounded parallel-time tampering (Q2129009): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3193074191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computational Split-state Non-malleable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable Reductions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Malleable Codes from Additive Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes against bounded polynomial time tampering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes for decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: TARDIS: a foundation of time-lock puzzles in UC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-collision resistant hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Lock Puzzles from Randomized Encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-collision resistance: a paradigm for keyless hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-message zero knowledge and non-malleable commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable extractors and codes, with their many tampered extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes and extractors for small-depth circuits, and affine functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit two-source extractors and resilient functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity of Non-Malleable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Non-Malleable Commitments (and More) in 3 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-round concurrent non-malleable commitments from one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Malleable Encryption: Simpler, Shorter, Stronger / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Decodable and Updatable Non-malleable Codes and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Fast Factorization of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Malleable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous verifiable delay functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes for space-bounded tampering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic group model and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant round non-malleable protocols using one way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Textbook non-malleable commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Zaps and New Techniques for NIZK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive non-malleability from quantum supremacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of time-lock puzzles and timed commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round optimal concurrent non-malleability from polynomial hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision resistant hashing for paranoids: dealing with multiple collisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: White-Box vs. Black-Box Complexity of Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New independent source extractors with exponential improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-malleable extractors, non-malleable codes and independent source extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleability amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round non-malleable commitments from any one-way function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Non-malleable Commitments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tamper and Leakage Resilience in the Split-State Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuously non-malleable codes in the split-state model from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive One-Way Functions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and improved constructions of non-malleable cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple verifiable delay functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verifiable delay functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:50, 28 July 2024

scientific article
Language Label Description Also known as
English
Non-malleable codes for bounded parallel-time tampering
scientific article

    Statements

    Non-malleable codes for bounded parallel-time tampering (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers