Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to Efficiently Evaluate RAM Programs with Malicious Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very-Efficient Simulatable Flipping of Many Coins into a Well / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additively Homomorphic UC Commitments with Optimal Amortized Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact VSS and Efficient Homomorphic UC Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Additively Homomorphic UC Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time encodable and list decodable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Encodable/Decodable Codes With Near-Optimal Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of UC Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Arithmetic Computation with No Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time encodable and decodable error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing pseudoentropy and simplifying pseudorandom generator constructions / rank
 
Normal rank

Latest revision as of 21:19, 12 July 2024

scientific article
Language Label Description Also known as
English
Rate-1, Linear Time and Additively Homomorphic UC Commitments
scientific article

    Statements

    Rate-1, Linear Time and Additively Homomorphic UC Commitments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2016
    0 references
    0 references
    0 references

    Identifiers