The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Conditionally-perfect secrecy and a provably-secure randomized cipher
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“First, they demonstrate that, although perfect secrecy can be achieved only when the entropy of the secret key is at least equal to that of the plaintext (see [ 9 ]), relaxing the notion of perfectness only slightly allows us to build a provably-secure cipher whose secret key is very short compared to the length of th…”
BackgroundWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
An introduction to contemporary cryptology
Massey, J. L. (1988) · Proceedings of the IEEE · doi:10.1109/5.4440 · Cited by 253
Cascade ciphers: The importance of being first
Maurer, U. M., & Massey, J. L. (1993) · Journal of Cryptology · doi:10.1007/bf02620231 · Cited by 110
Self-citationPerfect cryptographic security from partially independent channels
Maurer, U. M. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103476 · Cited by 41
Self-citation
Cited by
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Self-citationEntropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Public-Key Cryptosystems Resilient to Key Leakage
Naor, M., & Segev, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_2 · Cited by 403
Infeasibility of instance compression and succinct PCPs for NP
Fortnow, L., & Santhanam, R. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2010.06.007 · Cited by 288
Trevisan's Extractor in the Presence of Quantum Side Information
De, A., Portmann, C., Vidick, T., & Renner, R. (2012) · SIAM Journal on Computing · doi:10.1137/100813683 · Cited by 161
The Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65
Metadata
- Authors
- Maurer, U. M.
- Venue
- Journal of Cryptology
- Published
- 1992-01
- Volume
- 5
- Issue
- 1
- Pages
- 53-66
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W1968372742
- Cited by
- 259
- References
- 8
- FWCI
- 1.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.