Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689): 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-642-25516-8_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W124219044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Everlasting security in the bounded storage model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and privacy amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Hashing: An Information Theoretic Tool (Invited Talk) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reductions Between Oblivious Transfers Using Interactive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-Theoretic Conditions for Two-Party Secure Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Transfer and Linear Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round oblivious transfer in the bounded storage model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Oblivious Transfer in the Bounded-Storage Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditionally-perfect secrecy and a provably-secure randomized cipher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authentication theory and hypothesis testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero-knowledge arguments for NP using any one-way permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on authentication after having observed a sequence of messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic bounds for authentication schemes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction
scientific article

    Statements

    Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (English)
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    0 references