Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263): 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-030-97121-2_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214513733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure circuit evaluation. A protocol based on hiding information from an oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and scalable universal circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calling Out Cheaters: Covert Security with Public Verifiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security against covert adversaries: Efficient protocols for realistic adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero-Knowledge Argument for Correctness of a Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blazing fast OT for three-round UC OT extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious polynomial evaluation and oblivious neural learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box transformations from passive to covert security with public verifiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic compiler for publicly verifiable covert multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient universal circuit constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient secure two-party protocols. Techniques and constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covert security with public verifiability: faster, leaner, and simpler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Private Function Evaluation with Linear Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actively Secure OT Extension with Optimal Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valiant’s Universal Circuit is Practical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Verifiability in the Covert Model (Almost) for Free / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Universal Circuit Construction and Secure Evaluation of Private Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of security of Yao's protocol for two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind polynomial evaluation and data trading / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Actively Secure Private Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Polynomial Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic constructions of efficient pseudo-random functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal circuits (Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valiant's universal circuits revisited: an overall improvement and a lower bound / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 29 July 2024

scientific article; zbMATH DE number 7554917
Language Label Description Also known as
English
Making Private Function Evaluation Safer, Faster, and Simpler
scientific article; zbMATH DE number 7554917

    Statements

    Making Private Function Evaluation Safer, Faster, and Simpler (English)
    0 references
    8 July 2022
    0 references
    0 references
    extended permutation
    0 references
    private function evaluation
    0 references
    publicly verifiable covert security
    0 references
    secure two-party computation
    0 references
    0 references
    0 references