Position-Based Cryptography

@article{Chandran2014PositionBasedC,
  title={Position-Based Cryptography},
  author={Nishanth Chandran and Vipul Goyal and R. Moriarty and R. Ostrovsky},
  journal={IACR Cryptol. ePrint Arch.},
  year={2014},
  volume={2009},
  pages={364}
}
In this paper, we initiate the theoretical study of cryptographic protocols where the identity, or other credentials and inputs, of a party are derived from its geographic location. We start by considering the central task in this setting, i.e., securely verifying the position of a device. Despite much work in this area, we show that in the vanilla (or standard) model, the above task (i.e., of secure positioning) is impossible to achieve, even if we assume that the adversary is computationally… Expand
Position-Based Cryptography
TLDR
It is proved that in both models, no secure position-verification protocol can exist, unless assumptions are made that would make these models inapplicable. Expand
Position-Based Quantum Cryptography: Impossibility and Constructions
TLDR
This work study position-based cryptography in the quantum setting to use the geographical position of a party as its only credential and shows that if adversaries are allowed to share an arbitrarily large entangled quantum state, the task of secure position-verification is impossible. Expand
Position-Based Cryptography and Multiparty Communication Complexity
TLDR
Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky, aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Expand
Fully general device-independence for two-party cryptography and position verification
Device-independent quantum cryptography allows security even if the devices used to execute the protocol are untrusted - whether this is due to unknown imperfections in the implementation, or becauseExpand
Attack strategies for position-based quantum cryptography based on the Clifford Hierarchy
TLDR
A new family of protocols is introduced, that generalizes a construction by Lau and Lo and appears to be immune against polynomialcomplexity attacks against a large family of practical protocols, which rely on teleportation gates and can be quantified with the notion of Cli↵ord hierarchy. Expand
Practical and Provably Secure Distance-Bounding
TLDR
This paper proves that SKI and its variants is provably secure, even under the real-life setting of noisy communications, against the main types of relay attacks: distance-fraud and generalised versions of mafia- and terrorist-f fraud. Expand
In-region Authentication
TLDR
In-Region Authentication (inRA), a novel type of authentication, that allows a prover to prove to a set of cooperating verifiers that they are in possession of the correct secret key, and are inside a specified (policy) region of arbitrary shape is introduced. Expand
Secure Distance Bounding Verification using Physical-Channel Properties
TLDR
It is shown it is possible to construct efficient DBV protocols with DFA and MFA security, even against an unbounded adversary; on the other hand, it is impossible to design TFA-secure protocols without time measurement, even with a computationally-bounded adversary. Expand
Device independence for two-party cryptography and position verification with memoryless devices
Quantum communication has demonstrated its usefulness for quantum cryptography far beyond quantum key distribution. One domain is two-party cryptography, whose goal is to allow two parties who mayExpand
Position-based quantum cryptography and catalytic computation
In this thesis, we present several results along two different lines of research. The first part concerns the study of position-based quantum cryptography, a topic in quantum cryptography. ByExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Position Based Cryptography
TLDR
The main contribution in this paper is to place the problem of secure positioning on a sound theoretical footing, to prove a strong impossibility result that simultaneously shows the insecurity of previous attempts at the problem, and to present positive results by showing that the bounded-storage framework is one of the "right" frameworks to study the foundations of position-based cryptography. Expand
Perfectly Secure Password Protocols in the Bounded Retrieval Model
TLDR
This model studies the problem of constructing efficient password protocols that remain secure against offline dictionary attacks even when a large (but bounded) part of the storage of the server responsible for password verification is retrieved by an intruder through a remote or local connection. Expand
Everlasting security in the bounded storage model
TLDR
This work presents a scheme for efficient secure two-party communication with provable everlasting security, based on the bounded storage model, and guarantees that even a computationally all powerful adversary gains no information about a message. Expand
Hyper-Encryption and Everlasting Security
TLDR
The shared secret key employed by the sender Alice and the receiver Bob can be re-used to send an exponential number of messages, against strong adaptive attacks, and is provably secure against adaptive attacks by a computationally unbounded adversary in the bounded storage model. Expand
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
  • Chi-Jen Lu
  • Computer Science
  • Journal of Cryptology
  • 2003
TLDR
It is shown that an encryption scheme with such nice properties can be derived immediately from any strong randomness extractor, a function which extracts randomness from a slightly random source, so that its output and its seed together are almost random. Expand
Oblivious Transfer in the Bounded Storage Model
TLDR
This work improves the work of CCM in two ways and proves that in this protocol, a dishonest storage-bounded receiver succeeds with probability only 2-O(k), without repitition of the protocol. Expand
On Forward-Secure Storage
TLDR
A formal definition of the FSS is provided, some FSS schemes are proposed, and it is shown that FSS can be composed sequentially in a secure way. Expand
Error Correction in the Bounded Storage Model
  • Y. Ding
  • Mathematics, Computer Science
  • TCC
  • 2005
TLDR
This paper provides a general paradigm for constructing secure and error-resilient private-key cryptosystems in the bounded storage model that tolerate a constant fraction of errors, and attain the near optimal parameters achieved by Vadhan's construction (JoC, 2004) in the errorless case. Expand
Leakage-Resilient Cryptography
TLDR
A stream-cipher S is constructed whose implementation is secure even if a bounded amount of arbitrary (adversarially chosen) information on the internal state of S is leaked during computation, and a lemma is proved that the output of any PRG has high HILLpseudoentropy even if arbitrary information about the seed is leaked. Expand
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
TLDR
This work constructs an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model, and shows how to instantiate it without random oracles. Expand
...
1
2
3
4
5
...