Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security
From MaRDI portal
Publication:2798768
DOI10.1007/978-3-662-49384-7_1zbMath1388.94073OpenAlexW2296722348MaRDI QIDQ2798768
Takahiro Matsuda, Goichiro Hanaoka
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_1
public key encryptionkey encapsulation mechanismchosen ciphertext securityplaintext-awarenesstrapdoor simulatability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling and verifying the AODV routing protocol
- Better abstractions for timed automata
- Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
- Formal modeling and analysis of timed systems. 5th international conference, FORMATS 2007, Salzburg, Austria, October 3--5, 2007. Proceedings
- Uppaal in a nutshell
- Automata-based symbolic string analysis for vulnerability detection
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
- Timed I/O automata
- Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
- Safe and Optimal Adaptive Cruise Control
- Automatic Abstraction Refinement for Timed Automata
- The essence of command injection attacks in web applications
- Programming Techniques: Regular expression search algorithm
- Formal Approaches to Software Testing
- Model Checking Software
This page was built for publication: Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security
