Fraud within Asymmetric Multi-Hop Cellular Networks

Related publications (29)

Page 3 of 3

About
Privacy
Disclaimer

Graph Chatbot

Privacy-Friendly Photo Sharing and Relevant Applications Beyond

Lin Yuan

Popularization of online photo sharing brings people great convenience, but has also raised concerns for privacy. Researchers proposed various approaches to enable image privacy, most of which focus on encrypting or distorting image visual content. In this ...

EPFL2017

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Bryan Alexander Ford, Linus Gasser, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

The secret keys of critical network authorities – such as time, name, certificate, and software update services – represent high-value targets for hackers, criminals, and spy agencies wishing to use these keys secretly to compromise other hosts. To protect ...

IEEE2016

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Signature Schemes Secure Against Hard-to-Invert Leakage

Sebastian Faust

Side-channel attacks allow the adversary to gain partial knowledge of the secret key when cryptographic protocols are implemented in real-world hardware. The goal of leakage resilient cryptography is to design cryptosystems that withstand such attacks. In ...

Springer2016

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification

Divesh Aggarwal

The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a weak random source x with min-entropy k and a uniformly random seed Y of length d, and ...

Ieee2016

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Algebraic Cryptanalysis of Deterministic Symmetric Encryption

Petr Susil

Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and ...

EPFL2015

Page 3 of 3