Efficient Protocols for Set Intersection and Pattern Matching With Security Against Malicious and Covert Adversaries

doi 10.1007/978-3-540-78524-8_10
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Private Matching and Set Intersection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Efficient Secure Two-Party Computation Against Malicious Adversaries

English

Configurable Security Protocols for Multi-Party Data Analysis With Malicious Participants

English

Goal Modelling for Security Problem Matching and Pattern Enforcement

International Journal of Secure Software Engineering
2017English

A Pattern Matching Coprocessor for Network Security

2005English

Efficient Indexes for Jumbled Pattern Matching With Constant-Sized Alphabet

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2016English

Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries

2015English

Reliable and Efficient PUF-based Key Generation Using Pattern Matching

2011English

Efficient Method for Parallel Process and Matching of Large Data Set in Grid Computing Environment

Journal of Engineering Science and Technology Review
Engineering
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy