Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4300025581 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2105.01417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way functions are essential for single-server private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete logarithm implementation of perfect zero-knowledge blobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Instantiability of Hash-and-Sign RSA Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent zero-knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the efficiency of encryption and digital signature schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Efficiency of Generic Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct constant-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Key Dependent Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new interactive hashing theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Complexity Assumptions for Statistically-Hiding Commitment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inaccessible entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for concurrent zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel coin-tossing and constant-round secure two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768332 / 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: Private Coins versus Public Coins in Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression from Collisions, or Why CRHF Combiners Have a Long Output / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Functions Do Not Amplify Well / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chosen-Ciphertext Security via Correlated Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chosen-Ciphertext Security via Correlated Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Very Weak Random Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Transfer Is Symmetric / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:45, 10 July 2024

scientific article; zbMATH DE number 6442147
Language Label Description Also known as
English
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
scientific article; zbMATH DE number 6442147

    Statements

    Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    0 references
    statistically hiding commitments
    0 references
    private information retrieval
    0 references
    one-way functions
    0 references
    black-box impossibility results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references