搜索结果: 1-4 共查到“知识库 f Stateless Tokens”相关记录4条 . 查询时间(0.187 秒)
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
cryptographic protocols
2014/3/5
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for universally composable secure computation. As our main result, we show an efficient oblivious-transfe...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number f Stateless Tokens
2012/6/14
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Minimal Number Stateless Tokens
2012/3/20
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Universally Composable Two-Party Computation Using Minimal Number
2012/8/28
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...