Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963): 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-662-53015-3_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2484657427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Non-adaptive to Adaptive Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Pseudorandom Functions via On-the-Fly Adaptation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Three-Move Blind Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round Optimal Blind Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Round Optimal Blind Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of verifiable secret sharing and secure multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / 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: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth projective hashing and two-message oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and Stateless Signatures from the RSA Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Branching Programs on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-concurrent secure two-party computation without setup assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure two-party computation via cut-and-choose oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Practical Active-Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maliciously Circuit-Private FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security arguments for digital signatures and blind signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250778 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:20, 12 July 2024

scientific article
Language Label Description Also known as
English
Two-Message, Oblivious Evaluation of Cryptographic Functionalities
scientific article

    Statements

    Two-Message, Oblivious Evaluation of Cryptographic Functionalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2016
    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

    Identifiers