To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1b539Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zhandry, Mark | - |
| dc.date.accessioned | 2021-10-08T19:48:15Z | - |
| dc.date.available | 2021-10-08T19:48:15Z | - |
| dc.date.issued | 2019 | en_US |
| dc.identifier.citation | Zhandry, Mark. "On ELFs, Deterministic Encryption, and Correlated-Input Security." In Annual International Conference on the Theory and Applications of Cryptographic Techniques (2019): pp. 3-32. doi:10.1007/978-3-030-17659-4_1 | en_US |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://www.cs.princeton.edu/~mzhandry/docs/papers/CorInputs.pdf | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1b539 | - |
| dc.description.abstract | We construct deterministic public key encryption secure for any constant number of arbitrarily correlated computationally unpredictable messages. Prior works required either random oracles or non-standard knowledge assumptions. In contrast, our constructions are based on the exponential hardness of DDH, which is plausible in elliptic curve groups. Our central tool is a new trapdoored extremely lossy function, which modifies extremely lossy functions by adding a trapdoor. | en_US |
| dc.format.extent | 3 - 32 | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartof | Annual International Conference on the Theory and Applications of Cryptographic Techniques | en_US |
| dc.rights | Author's manuscript | en_US |
| dc.title | On ELFs, Deterministic Encryption, and Correlated-Input Security | en_US |
| dc.type | Conference Article | en_US |
| dc.identifier.doi | 10.1007/978-3-030-17659-4_1 | - |
| dc.identifier.eissn | 1611-3349 | - |
| pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| DeterministicEncryptionCorrelatedInputSecurity.pdf | 630.35 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.