Explore a talk from PKC 2010 on Text Search Protocols with Simulation Based Security, presented by authors Rosario Gennaro, Carmit Hazay, and Jeffrey S. Sorensen. Delve into the intricacies of automata encryption, select and evaluation techniques, and the KNP approach. Discover applications, previous research, and a simplified protocol explanation using real-world examples like militia scenarios. Gain insights into security requirements, motivations behind the research, and the fundamental concepts of automata in cryptography. Conclude with a comprehensive understanding of text search protocols and their implications for secure information retrieval.
Text Search Protocols with Simulation Based Security
Overview
Syllabus
Introduction
Applications
Papers
Previous Talk
Overview
Simpler Protocol
Simpler Example
Militia Example
What is an Automata
Security Requirements
Motivations
KNP Techniques
Automata
Automata Encryption
Select
Evaluation
Conclusion
Taught by
TheIACR
