General Construction of Chameleon All-But-One Trapdoor Functions
From MaRDI portal
Publication:3092363
DOI10.1007/978-3-642-24316-5_18zbMath1298.94095OpenAlexW2142420110MaRDI QIDQ3092363
Robert H. Deng, Shengli Liu, Junzuo Lai
Publication date: 16 September 2011
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/1419
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building Lossy Trapdoor Functions from Lossy Encryption
- One-Time Signatures and Chameleon Hash Functions
- Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security
- Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- A Framework for Efficient and Composable Oblivious Transfer
- Chosen-Ciphertext Security via Correlated Products
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Efficient Non-interactive Universally Composable String-Commitment Schemes
- How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
This page was built for publication: General Construction of Chameleon All-But-One Trapdoor Functions