Branding/Logomark minus Citation Combined Shape Icon/Bookmark-empty Icon/Copy Icon/Collection Icon/Close Copy 7 no author result Created with Sketch. Icon/Back Created with Sketch. Match!
Byoungcheon Lee
Information and Communications University
45Publications
18H-index
1,320Citations
Publications 45
Newest
Published on Apr 30, 2017
Byoungcheon Lee18
Estimated H-index: 18
Source Cite
Published on Aug 1, 2014 in SECRYPT (International Conference on Security and Cryptography)
Byoungcheon Lee18
Estimated H-index: 18
In ubiquitous computing environment it is common that a user owns and uses multiple computing devices, but managing cryptographic keys in those devices is a complicated matter. If certificate-based cryptography (PKI) is used such that each device has independent certificate, then user has to be involved in multiple certificate issuing processes with certification authorities (CA) and has to keep multiple private keys securely. If a single user certificate is copied and shared in multiple user de...
1 Citations Source Cite
Published on Dec 1, 2013
Byoungcheon Lee18
Estimated H-index: 18
Secret signatures, proposed by Lee \textit{et al.} \cite{LCYY07,LLK09}, provide signature privacy and public provability at the same time. Using these schemes a signer can send his signature secretly to a designated receiver such that only the designated receiver can verify the signature. Moreover, if any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. But in these schemes one of the drawback is that the signer has t...
Source Cite
Published on Apr 1, 2011in Information Sciences 5.52
Xiaofeng Chen43
Estimated H-index: 43
(Xidian University),
Qianhong Wu22
Estimated H-index: 22
(WHU: Wuhan University)
+ 5 AuthorsKwangjo Kim31
Estimated H-index: 31
(KAIST)
It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework, Okamoto first proposed a receipt-free voting scheme [30] for large scale elections. However, in the following paper, Okamoto [31] proved that the scheme [30] was not receipt-free and presented two improved schemes. One scheme requires the help of the parameter registration committee and the other needs a stronger...
19 Citations Source Cite
Published on Mar 31, 2011in Journal of Information Processing Systems
Divyan M. Konidala7
Estimated H-index: 7
(KAIST),
Daeyoung Kim25
Estimated H-index: 25
(KAIST)
+ 1 AuthorsByoungcheon Lee18
Estimated H-index: 18
The concept of Smart-Homes is becoming more and more popular. It is anticipated that Radio Frequency IDentification (RFID) technology will play a major role in such environments. We can find many previously proposed schemes that focus solely on: authentication between the RFID tags and readers, and user privacy protection from malicious readers. There has also been much talk of a very popular RFID application: a refrigerator/bookshelf that can scan and list out the details of its items on its di...
19 Citations Source Cite
Published on Feb 1, 2010 in ARES (Availability, Reliability and Security)
Byoungcheon Lee18
Estimated H-index: 18
Certificate-based cryptography and ID-based cryptography have been designed under different theoretical backgrounds and they have their own advantages and drawbacks, but there have been few works which try to provide them together in an efficient way. Chen et al. [4] considered a hybrid scheme of public key infrastructure (PKI) and ID-based encryption (IBE), and also discussed various trust relationship among multiple authorities, but they have not discussed more in-depth implementation issues o...
7 Citations Source Cite
Published on Nov 1, 2009
Byoungcheon Lee18
Estimated H-index: 18
,
Jin Li10
Estimated H-index: 10
(IIT: Illinois Institute of Technology),
Kwangjo Kim31
Estimated H-index: 31
(KAIST)
Secret signature, proposed by Lee et al. [11], is a new signature scheme which provides signature privacy and public provability together. Using the secret signature scheme a signer can send his signature secretly to a specific receiver such that only the designated receiver can verify the signature. If any argument occurs between them, the validity of the secret signature can be proven publicly either by the signer or the receiver. Thus it can be used as an important cryptographic primitive to ...
2 Citations Source Cite
Published on Aug 27, 2007
Byoungcheon Lee18
Estimated H-index: 18
,
Kim-Kwang Raymond Choo41
Estimated H-index: 41
(Australian Institute of Criminology)
+ 1 AuthorsSeung-Jae Yoo3
Estimated H-index: 3
Digital signatures provide authentication and nonrepudiation in a public way in the sense that anyone can verify the validity of a digital signature using the corresponding public key. In this paper, we consider the issues of (1) signature privacy and (2) the corresponding public provability of signature. We propose a new digital signature variant, secret signature, which provides authentication and nonrepudiation to the designated receiver only. If required, the correctness of the secret signat...
3 Citations Source Cite
Published on Jan 1, 2006
Min Surp Rhee1
Estimated H-index: 1
,
Byoungcheon Lee18
Estimated H-index: 18
Invited Talks.- RFID Privacy Based on Public-Key Cryptography.- Generic Attacks on Symmetric Ciphers.- Hash Functions - I.- Improved Collision Attack on the Hash Function Proposed at PKC'98.- Hashing with Polynomials.- Birthday Paradox for Multi-collisions.- Block and Stream Ciphers.- New Variant of the Self-Shrinking Generator and Its Cryptographic Properties.- On Constructing of a 32 x32 Binary Matrix as a Diffusion Layer for a 256-Bit Block Cipher.- On Algebraic Immunity and Annihilators.- Ef...
Published on Dec 10, 2005
Kun Peng13
Estimated H-index: 13
(QUT: Queensland University of Technology),
Colin Boyd38
Estimated H-index: 38
(QUT: Queensland University of Technology)
+ 1 AuthorsByoungcheon Lee18
Estimated H-index: 18
A new cryptographic protocol —ciphertext comparison— can compare two ciphertexts without revealing the two encrypted messages. Correctness of the comparison can be publicly verified. This technique provides an efficient and publicly verifiable solution to the famous millionaire problem. It is the first solution to the millionaire problem to output a precise result (the two messages are equal or which is larger). Privacy in this new solution is achieved with an overwhelmingly large probability an...
13 Citations Source Cite
1234