On the public citation graph

Unconditional security against memory-bounded adversaries

0 signed · 166 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471200611openalex-snapshot

Elements of Information Theory

inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot

Communication Theory of Secrecy Systems*

inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot

Simple Constructions of Almost k‐wise Independent Random Variables

inferredcites →https://doi.org/10.1007/3-540-48285-7_35openalex-snapshot

Secret-Key Reconciliation by Public Discussion

inferredcites →https://doi.org/10.1007/3-540-60693-9_11openalex-snapshot

A storage complexity based analogue of Maurer key establishment using public channels

inferredcites →https://doi.org/10.1007/3-540-69053-0_21openalex-snapshot

Efficient Cryptographic Protocols Based on Noisy Channels

inferredcites →https://doi.org/10.1007/bf00191321openalex-snapshot

Conditionally-perfect secrecy and a provably-secure randomized cipher

inferredcites →https://doi.org/10.1007/bf01940870openalex-snapshot

Simulating BPP using a general weak random source

inferredcites →https://doi.org/10.1007/s001459900023openalex-snapshot

Linking information reconciliation and privacy amplification

inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot

Universal classes of hash functions

inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot

New hash functions and their use in authentication and set equality

inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50018-7openalex-snapshot

Cryptography

inferredcites →https://doi.org/10.1109/18.256484openalex-snapshot

Secret key agreement by public discussion from common information

inferredcites →https://doi.org/10.1109/18.476316openalex-snapshot

Generalized privacy amplification

inferredcites →https://doi.org/10.1109/35.544331openalex-snapshot

Satellites for wideband access

inferredcites →https://doi.org/10.1109/ccc.1996.507667openalex-snapshot

Extracting randomness: how and why. A survey

inferredcites →https://doi.org/10.1109/jsac.1996.510901openalex-snapshot

Guest Editorial Optical Networks

inferredcites →https://doi.org/10.1109/sfcs.1988.21920openalex-snapshot

Achieving oblivious transfer using weakened security assumptions

inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot

Algorithms for quantum computation: discrete logarithms and factoring

inferredcites →https://doi.org/10.1145/235666.235669openalex-snapshot

25 years of quantum cryptography

inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot

Pseudorandomness and Cryptographic Applications

inferredcites →https://doi.org/10.1561/0400000009openalex-snapshot

Pairwise Independence and Derandomization

inferredcites →https://doi.org/10.3929/ethz-a-001806220openalex-snapshot

Entropy measures and unconditional security in cryptography

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9783527640331.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1007/11681878_11openalex-snapshot

Intrusion-Resilience Via the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/11787006_17openalex-snapshot

On Everlasting Security in the Hybrid Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/11818175_15openalex-snapshot

On Forward-Secure Storage

inferred← citeshttps://doi.org/10.1007/3-540-36178-2_9openalex-snapshot

Efficient Oblivious Transfer in the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/3-540-44647-8_9openalex-snapshot

Oblivious Transfer in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/3-540-44849-7_7openalex-snapshot

Hyper Encryption and Everlasting Secrets

inferred← citeshttps://doi.org/10.1007/3-540-45708-9_17openalex-snapshot

Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors

inferred← citeshttps://doi.org/10.1007/3-540-45841-7_1openalex-snapshot

Hyper-Encryption and Everlasting Security

inferred← citeshttps://doi.org/10.1007/3-540-48405-1_4openalex-snapshot

Information-Theoretic Cryptography

inferred← citeshttps://doi.org/10.1007/3-540-48405-1_5openalex-snapshot

Information Theoretically Secure Communication in the Limited Storage Space Model

inferred← citeshttps://doi.org/10.1007/3-540-48969-x_10openalex-snapshot

Unconditional Security in Cryptography

inferred← citeshttps://doi.org/10.1007/978-1-4419-1385-2_12openalex-snapshot

Secret Communication over Fading Channels

inferred← citeshttps://doi.org/10.1007/978-3-030-01177-2_85openalex-snapshot

Simulations for Deep Random Secrecy Protocol

inferred← citeshttps://doi.org/10.1007/978-3-030-03810-6_3openalex-snapshot

Fine-Grained Secure Computation

inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_17openalex-snapshot

Simple Schemes in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-030-22868-2_42openalex-snapshot

Deep Random Based Key Exchange Protocol Resisting Unlimited MITM

inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_22openalex-snapshot

Fine-Grained Cryptography Revisited

inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_9openalex-snapshot

Interactive Non-malleable Codes

inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_15openalex-snapshot

Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot

On the Streaming Indistinguishability of a Random Permutation and a Random Function

inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_5openalex-snapshot

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era

inferred← citeshttps://doi.org/10.1007/978-3-030-61078-4_17openalex-snapshot

Information-Theoretic Security of Cryptographic Channels

inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_4openalex-snapshot

Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-030-92641-0_14openalex-snapshot

Secure Multiparty Computation in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_24openalex-snapshot

Incompressible Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_26openalex-snapshot

Authentication in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_2openalex-snapshot

Rate-1 Incompressible Encryption from Standard Assumptions

inferred← citeshttps://doi.org/10.1007/978-3-031-30545-0_4openalex-snapshot

Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited

inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_8openalex-snapshot

Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions

inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_10openalex-snapshot

On Bounded Storage Key Agreement and One-Way Functions

inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_18openalex-snapshot

Zero-Knowledge in Streaming Interactive Proofs

inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_13openalex-snapshot

How to Verify that a Small Device is Quantum, Unconditionally

inferred← citeshttps://doi.org/10.1007/978-3-319-21966-0_7openalex-snapshot

Distance Lower Bounding

inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_3openalex-snapshot

Position-Based Cryptography and Multiparty Communication Complexity

inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_25openalex-snapshot

Constant-Round Oblivious Transfer in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_8openalex-snapshot

On Generating the Initial Key in the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_26openalex-snapshot

On the (Im)possibility of Non-interactive Correlation Distillation

inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_28openalex-snapshot

Non-interactive Timestamping in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_31openalex-snapshot

Error Correction in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_4openalex-snapshot

On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_3openalex-snapshot

Long-Term Security and Universal Composability

inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_12openalex-snapshot

Random Oracles and Auxiliary Input

inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_4openalex-snapshot

Basing Weak Public-Key Cryptography on Strong One-Way Functions

inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_8openalex-snapshot

A Single Initialization Server for Multi-party Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_15openalex-snapshot

Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_22openalex-snapshot

Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle

inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_23openalex-snapshot

Position Based Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-642-04904-0_34openalex-snapshot

Vintage Bit Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_11openalex-snapshot

Information Theoretic Security Based on Bounded Observability

inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_39openalex-snapshot

Secure Code Update for Embedded Devices via Proofs of Secure Erasure

inferred← citeshttps://doi.org/10.1007/978-3-642-25405-5_17openalex-snapshot

A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys

inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_8openalex-snapshot

Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction

inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_45openalex-snapshot

Quantum to Classical Randomness Extractors

inferred← citeshttps://doi.org/10.1007/978-3-642-32284-6_1openalex-snapshot

Guessing Secrecy

inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_25openalex-snapshot

Scalable Byzantine Agreement with a Random Beacon

inferred← citeshttps://doi.org/10.1007/978-3-642-38519-3_11openalex-snapshot

Nested Merkle’s Puzzles against Sampling Attacks

inferred← citeshttps://doi.org/10.1007/978-3-642-38616-9_9openalex-snapshot

Quantum Key Distribution in the Classical Authenticated Key Exchange Framework

inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_19openalex-snapshot

Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling

inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_8openalex-snapshot

Revocable Quantum Timed-Release Encryption

inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_19openalex-snapshot

Fine-Grained Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_14openalex-snapshot

Big-Key Symmetric Encryption: Resisting Key Exfiltration

inferred← citeshttps://doi.org/10.1007/s00145-003-0217-1openalex-snapshot

Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors

inferred← citeshttps://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot

Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/s00145-003-0309-yopenalex-snapshot

Optimal Randomizer Efficiency in the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/s00145-006-0438-1openalex-snapshot

Constant-Round Oblivious Transfer in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1007/s00145-008-9035-9openalex-snapshot

Non-interactive Timestamping in the Bounded-Storage Model

inferred← citeshttps://doi.org/10.1007/s00145-010-9068-8openalex-snapshot

Long-Term Security and Universal Composability

inferred← citeshttps://doi.org/10.1007/s00145-021-09390-3openalex-snapshot

Fine-Grained Cryptography Revisited

inferred← citeshttps://doi.org/10.1007/s00145-022-09432-4openalex-snapshot

Everlasting UC Commitments from Fully Malicious PUFs

inferred← citeshttps://doi.org/10.1007/s00450-006-0011-zopenalex-snapshot

Quantum cryptography beyond key exchange

inferred← citeshttps://doi.org/10.1007/s10623-012-9747-6openalex-snapshot

Long term confidentiality: a survey

inferred← citeshttps://doi.org/10.1007/s10623-015-0157-4openalex-snapshot

Quantum cryptography beyond quantum key distribution

inferred← citeshttps://doi.org/10.1007/s10626-007-0032-1openalex-snapshot

Analyzing Security Protocols Using Time-Bounded Task-PIOAs

inferred← citeshttps://doi.org/10.1016/j.adhoc.2011.09.002openalex-snapshot

Information security for sensors by overwhelming random sequences and permutations

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.016openalex-snapshot

Public-key cryptography based on bounded quantum reference frames

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.018openalex-snapshot

Using quantum key distribution for cryptographic purposes: A survey

inferred← citeshttps://doi.org/10.1038/ncomms2268openalex-snapshot

Experimental implementation of bit commitment in the noisy-storage model

inferred← citeshttps://doi.org/10.1038/s41467-018-03729-4openalex-snapshot

Continuous-variable protocol for oblivious transfer in the noisy-storage model

inferred← citeshttps://doi.org/10.1063/1.1619215openalex-snapshot

Generation of information theoretic secure keys using a chaotic semiconductor laser

inferred← citeshttps://doi.org/10.1088/2058-9565/aa69cdopenalex-snapshot

Quantum cryptography: a view from classical cryptography

inferred← citeshttps://doi.org/10.1098/rsta.2016.0243openalex-snapshot

Quantum photonic network and physical layer security

inferred← citeshttps://doi.org/10.1103/revmodphys.89.015002openalex-snapshot

Entropic uncertainty relations and their applications

inferred← citeshttps://doi.org/10.1109/acssc.2014.7094820openalex-snapshot

Everlasting secrecy in disadvantaged wireless environments against sophisticated eavesdroppers

inferred← citeshttps://doi.org/10.1109/allerton.2012.6483223openalex-snapshot

Exploiting the non-commutativity of nonlinear operators for information-theoretic security in disadvantaged wireless environments

inferred← citeshttps://doi.org/10.1109/ccst.2003.1297617openalex-snapshot

TSRG randomized cryptosystem

inferred← citeshttps://doi.org/10.1109/focs.2016.36openalex-snapshot

Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning

inferred← citeshttps://doi.org/10.1109/globecom46510.2021.9685688openalex-snapshot

Perfect Secrecy in the Bounded Storage Model

inferred← citeshttps://doi.org/10.1109/glocom.2007.18openalex-snapshot

Dense Parity Check Based Secrecy Sharing in Wireless Communications

inferred← citeshttps://doi.org/10.1109/icspcs50536.2020.9310024openalex-snapshot

On the Shannon Perfect Secrecy Result

inferred← citeshttps://doi.org/10.1109/ieeeconf53345.2021.9723278openalex-snapshot

A New Security Scheme for Cloud Storage Systems and Its Performance Evaluation using Avalanche Effect

inferred← citeshttps://doi.org/10.1109/isit.2006.262102openalex-snapshot

Secret Key Capacity and Advantage Distillation Capacity

inferred← citeshttps://doi.org/10.1109/isit.2013.6620766openalex-snapshot

Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy

inferred← citeshttps://doi.org/10.1109/isit.2014.6875108openalex-snapshot

Oblivious transfer in the bounded storage model with errors

inferred← citeshttps://doi.org/10.1109/isit.2015.7282995openalex-snapshot

Maximal Correlation Secrecy

inferred← citeshttps://doi.org/10.1109/itcc.2004.1286416openalex-snapshot

Jigsaw-based secure data transfer over computer networks

inferred← citeshttps://doi.org/10.1109/itnw.1999.814349openalex-snapshot

Security against memory-bounded adversaries

inferred← citeshttps://doi.org/10.1109/itw.2012.6404652openalex-snapshot

Privacy amplification theorem for bounded storage eavesdropper

inferred← citeshttps://doi.org/10.1109/jiot.2025.3595493openalex-snapshot

An Unconditionally Secure Encryption Scheme for IoBT Networks

inferred← citeshttps://doi.org/10.1109/jproc.2015.2462837openalex-snapshot

Secret-Key Distribution Based on Bounded Observability

inferred← citeshttps://doi.org/10.1109/jsac.2013.130915openalex-snapshot

Everlasting Secrecy by Exploiting Non-Idealities of the Eavesdropper's Receiver

inferred← citeshttps://doi.org/10.1109/milcom.2013.87openalex-snapshot

Diffie's Wireless Phone: Heterodyning-Based Physical-Layer Encryption

inferred← citeshttps://doi.org/10.1109/milcom58377.2023.10356259openalex-snapshot

A Practical Perfect Secrecy Approach for IoBT Systems

inferred← citeshttps://doi.org/10.1109/ntms.2012.6208676openalex-snapshot

Perfect Confidentiality Network: A Solution for Information Theoretically Secure Key Agreement

inferred← citeshttps://doi.org/10.1109/pst.2016.7907013openalex-snapshot

Efficient proactive secret sharing

inferred← citeshttps://doi.org/10.1109/sai.2017.8252187openalex-snapshot

Why is deep random suitable for cryptology

inferred← citeshttps://doi.org/10.1109/sfcs.1998.743500openalex-snapshot

Oblivious transfer with a memory-bounded receiver

inferred← citeshttps://doi.org/10.1109/sfcs.2005.30openalex-snapshot

Cryptography In the Bounded Quantum-Storage Model

inferred← citeshttps://doi.org/10.1109/tit.2002.1003845openalex-snapshot

Everlasting security in the bounded storage model

inferred← citeshttps://doi.org/10.1109/tit.2005.864438openalex-snapshot

How to fool an unbounded adversary with a short key

inferred← citeshttps://doi.org/10.1109/tit.2008.921864openalex-snapshot

The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement

inferred← citeshttps://doi.org/10.1109/tit.2013.2291780openalex-snapshot

Quantum to Classical Randomness Extractors

inferred← citeshttps://doi.org/10.1109/tit.2014.2371464openalex-snapshot

Entanglement Sampling and Applications

inferred← citeshttps://doi.org/10.1109/tit.2018.2796128openalex-snapshot

Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

inferred← citeshttps://doi.org/10.1109/twc.2009.081048openalex-snapshot

Key establishment schemes against storage-bounded adversaries in wireless sensor networks

inferred← citeshttps://doi.org/10.1109/twc.2015.2448074openalex-snapshot

Jamming Based on an Ephemeral Key to Obtain Everlasting Security in Wireless Environments

inferred← citeshttps://doi.org/10.1109/twc.2018.2812881openalex-snapshot

Multi-Hop Routing in Covert Wireless Networks

inferred← citeshttps://doi.org/10.1109/twc.2022.3185492openalex-snapshot

Optimal Geometric Solutions to UAV-Enabled Covert Communications in Line-of-Sight Scenarios

inferred← citeshttps://doi.org/10.1137/100805005openalex-snapshot

Position-Based Cryptography

inferred← citeshttps://doi.org/10.1145/1315245.1315295openalex-snapshot

Robust key generation from signal envelopes in wireless networks

inferred← citeshttps://doi.org/10.1145/1860684.1860694openalex-snapshot

Information security for sensors by overwhelming random sequences and permutations

inferred← citeshttps://doi.org/10.1145/1866307.1866392openalex-snapshot

Information security for sensors by overwhelming random sequences and permutations

inferred← citeshttps://doi.org/10.1145/3186563openalex-snapshot

Fast Learning Requires Good Memory

inferred← citeshttps://doi.org/10.1145/3564246.3585129openalex-snapshot

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory

inferred← citeshttps://doi.org/10.1145/509907.509960openalex-snapshot

Tight security proofs for the bounded-storage model

inferred← citeshttps://doi.org/10.11575/prism/27728openalex-snapshot

Secure Distance Bounding

inferred← citeshttps://doi.org/10.15248/proc.1.340openalex-snapshot

Experiment on secure key distribution using correlated random phenomenon in semiconductor lasers

inferred← citeshttps://doi.org/10.2172/877141openalex-snapshot

Key management and encryption under the bounded storage model.

inferred← citeshttps://doi.org/10.22331/q-2021-04-08-429openalex-snapshot

Towards Quantum One-Time Memories from Stateless Hardware

inferred← citeshttps://doi.org/10.3390/e26030181openalex-snapshot

Wireless-Channel Key Distribution Based on Laser Synchronization

inferred← citeshttps://doi.org/10.3929/ethz-a-005664665openalex-snapshot

Concrete constructions of unbalanced bipartite expander graphs and generalized conductors

inferred← citeshttps://doi.org/10.3929/ethz-a-005954517openalex-snapshot

Exploring the Limits of Multi-Party Computation

inferred← citeshttps://doi.org/10.4230/dagsemproc.09311.3openalex-snapshot

Quantum key distribution and cryptography: a survey

inferred← citeshttps://doi.org/10.4230/lipics.tqc.2020.6openalex-snapshot

Quantum One-Time Memories from Stateless Hardware

inferred← citeshttps://doi.org/10.48550/arxiv.0903.5156openalex-snapshot

Public-key cryptography based on bounded quantum reference frames

inferred← citeshttps://doi.org/10.48550/arxiv.2101.10836openalex-snapshot

Separating Adaptive Streaming from Oblivious Streaming

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0405061openalex-snapshot

Jigsaw-based Security in Data Transfer in Computer Networks

inferred← citeshttps://doi.org/10.5937/vojtehg70-36607openalex-snapshot

Protocols for symmetric secret key establishment: Modern approach

inferred← citeshttps://doi.org/10.70675/71129bffza729z4b97zbdb0z152ee4a2fcabopenalex-snapshot

Quantum cryptography in a hybrid security model

inferred← citeshttps://doi.org/10.7275/2199659openalex-snapshot

Addressing/Exploiting Transceiver Imperfections in Wireless Communication Systems

inferred← citeshttps://doi.org/10.7275/7941790.0openalex-snapshot

Everlasting Secrecy by Exploiting Eavesdropper's Receiver Non-Idealities

inferred← citeshttps://doi.org/10.7907/t8hp-7r18.openalex-snapshot

Emerging Paradigms in Quantum Error Correction and Quantum Cryptography

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.