Non-malleable time-lock puzzles and applications (Q2697901): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-90456-2_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3213225843 / 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: Verifiable delay functions / 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: Random oracles and non-uniformity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable codes for bounded parallel-time tampering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain / 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: Secure integration of asymmetric and symmetric encryption schemes / 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: Cryptography in the multi-string model / 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: 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: Concurrent Non-Malleable Zero Knowledge Proofs / 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: Homomorphic time-lock puzzles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive One-Way Functions and Applications / 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: Concurrent Nonmalleable Commitments / 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: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Oracles and Auxiliary Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating safe primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verifiable delay functions / rank
 
Normal rank

Latest revision as of 22:38, 31 July 2024

scientific article
Language Label Description Also known as
English
Non-malleable time-lock puzzles and applications
scientific article

    Statements

    Non-malleable time-lock puzzles and applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2023
    0 references
    0 references
    multi-party protocols
    0 references
    random oracle model
    0 references
    0 references
    0 references