http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Universal Composability Notion for Functional Encryption Schemes
Sadikin, Rifki,Park, YoungHo,Park, KilHoum,Moon, SangJae Korea Society of Industrial Information Systems 2013 한국산업정보학회논문지 Vol.18 No.3
We have developed an ideal functionality for security requirement of functional encryption schemes. The functionality is needed when we want to show the security of a functional encryption scheme in universal composable (UC) framework. A functionality $F_{fe}$ was developed to represent ideal respond of a functional encryption scheme against any polynomial time active attacker. We show that UC security notion of functional encryption scheme $F_{fe}$ is as strong as fully secure functional encryption in an indistinguishable game with chosen cipher text attack. The proof used a method that showing for any environment algorithm, it can not distinguish ideal world where the attacker play with ideal functionality $F_{fe}$ and real world where the attacker play a fully secure functional encryption scheme.
Universal Composability Notion for Functional Encryption Schemes
Rifki Sadikin,YoungHo Park,KilHoum Park,SangJae Moon 한국산업정보학회 2013 한국산업정보학회논문지 Vol.18 No.3
We have developed an ideal functionality for security requirement of functional encryption schemes. The functionality is needed when we want to show the security of a functional encryption scheme in universal composable (UC) framework. A functionality Ffewas developed to represent ideal respond of a functional encryption scheme against any polynomial time active attacker. We show that UC security notion of functional encryption scheme Ffe is as strong as fully secure functional encryption in an indistinguishable game with chosen cipher text attack. The proof used a method that showing for any environment algorithm, it can not distinguish ideal world where the attacker play with ideal functionality Ffe and real world where the attacker play a fully secure functional encryption scheme.