The Experts below are selected from a list of 35667 Experts worldwide ranked by ideXlab platform
Max Tuengerthal - One of the best experts on this subject based on the ideXlab platform.
-
Universally Composable Symmetric Encryption.
IACR Cryptology ePrint Archive, 2009Co-Authors: Ralf Küsters, Max TuengerthalAbstract:For most basic cryptographic tasks, such as public Key encryption, digital signatures, Authentication, Key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract DolevYao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.
-
CSF - Universally Composable Symmetric Encryption
2009 22nd IEEE Computer Security Foundations Symposium, 2009Co-Authors: Ralf Küsters, Max TuengerthalAbstract:For most basic cryptographic tasks, such as public-Key encryption, digital signatures, Authentication, Key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract Dolev-Yao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively, provided that the environment does not create Key cycles or cause these-called commitment problem. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.
Guihua Zeng - One of the best experts on this subject based on the ideXlab platform.
-
continuous variable quantum identity Authentication based on quantum teleportation
Quantum Information Processing, 2016Co-Authors: Peng Huang, Wansu Bao, Guihua ZengAbstract:A continuous-variable quantum identity Authentication protocol, which is based on quantum teleportation, is presented by employing two-mode squeezed vacuum state and coherent state. The proposed protocol can verify user's identity efficiently with a new defined fidelity parameter. Update of Authentication Key can also be implemented in our protocol. Moreover, the analysis shows its feasibility and security under the general Gaussian-cloner attack on Authentication Key, which is guaranteed by quantum entanglement, insertion of decoy state and random displacement.
-
quantum identity Authentication based on ping pong technique for photons
Physics Letters A, 2006Co-Authors: Zheshen Zhang, Guihua Zeng, Nanrun Zhou, Jin XiongAbstract:To prevent active attack, an one-way quantum identity Authentication scheme is proposed by employing mechanism of ping-pong protocol and property of quantum controlled-NOT gate. It can verify the user's identity as well as distribute an updated Key as the Authentication Key. Analytical results show the proposed scheme is secure under general individual attack.
Ralf Küsters - One of the best experts on this subject based on the ideXlab platform.
-
Universally Composable Symmetric Encryption.
IACR Cryptology ePrint Archive, 2009Co-Authors: Ralf Küsters, Max TuengerthalAbstract:For most basic cryptographic tasks, such as public Key encryption, digital signatures, Authentication, Key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract DolevYao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.
-
CSF - Universally Composable Symmetric Encryption
2009 22nd IEEE Computer Security Foundations Symposium, 2009Co-Authors: Ralf Küsters, Max TuengerthalAbstract:For most basic cryptographic tasks, such as public-Key encryption, digital signatures, Authentication, Key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract Dolev-Yao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively, provided that the environment does not create Key cycles or cause these-called commitment problem. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.
Zhanjun Zhang - One of the best experts on this subject based on the ideXlab platform.
-
quantum identity Authentication based on ping pong technique without entanglements
Quantum Information Processing, 2014Co-Authors: Hao Yuan, Yimin Liu, Guozhu Pan, Gang Zhang, Jun Zhou, Zhanjun ZhangAbstract:A quantum identity Authentication scheme based on ping-pong technique without entanglements is proposed. It can verify the legitimate user's identity and update the initial Authentication Key for reuse. The security of the proposed scheme is extensively analyzed and accordingly confirmed in the case of general individual attacks. The present scheme owns high efficiency due to the use of single-particle states in a two-way quantum channel. Moreover, the scheme is economical and feasible with present-day technique.
Daesung Kwon - One of the best experts on this subject based on the ideXlab platform.
-
Quantum identity Authentication with single photon
Quantum Information Processing, 2017Co-Authors: Chang Ho Hong, Jin Gak Jang, Jin O. Heo, Daesung KwonAbstract:Quantum identity Authentication with single photons is proposed in the paper. It can verify a user’s identity without exposing to an Authentication Key information. The protocol guarantees high efficiency in that it can verify two bits of Authentication information using just a single photon. The security of our Authentication scheme is analyzed and confirmed in the case of a general attack. Moreover, the proposed protocol is practicable with current technology. Our quantum identity Authentication protocol does not require quantum memory registration and any entangled photon sources.
