# Strong secrecy

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- IEEE International Symposium on Informationâ€¦
- 2014

A security measure called effective security is defined that includes strong secrecy and stealth communication. Effective secrecyâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- IEEE Transactions on Information Theory
- 2013

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to theâ€¦Â (More)

Is this relevant?

2013

2013

- Information Theory, Combinatorics, and Searchâ€¦
- 2013

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the firstâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IEEE Transactions on Information Forensics andâ€¦
- 2011

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles withâ€¦Â (More)

Is this relevant?

2010

2010

- IEEE Information Theory Workshop
- 2010

We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strongâ€¦Â (More)

Is this relevant?

2009

2009

- 47th Annual Allerton Conference on Communicationâ€¦
- 2009

It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebookâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

Recent theoretical a potential to signifi information-theoreti concerns, which we community that a s bits from a block oâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Symposium on Security and Privacyâ€¦
- 2004

We present a new automatic technique for proving strong secrecy for security protocols. Strong secrecy means that an adversaryâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Information Theory
- 2004

We derive single-letter characterizations of (strong) secrecy capacities for models with an arbitrary number of terminals, eachâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- EUROCRYPT
- 2000

One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order toâ€¦Â (More)

Is this relevant?