Non-committing Encryption from Φ-hiding
作者： Brett Hemenway , Rafail Ostrovsky , Alon Rosen
DOI: 10.1007/978-3-662-46494-6_24
关键词:
摘要: A multiparty computation protocol is said to be adaptively secure if it retains its security even in the presence of an adversary who can corrupt participants as proceeds. This contrast static corruption model where forced choose which before begins.
springer.com
core.ac.uk
sci-hub.st 参考文章(20)
Brett Hemenway, Rafail Ostrovsky, Extended-DDH and lossy trapdoor functions public key cryptography. pp. 627- 643 ,(2012) , 10.1007/978-3-642-30057-8_37
Mark Lewko, Adam O’Neill, Adam Smith, Regularity of Lossy RSA on Subdomains and Its Applications theory and application of cryptographic techniques. pp. 55- 75 ,(2013) , 10.1007/978-3-642-38348-9_4
Donald Beaver, Plug and Play Encryption international cryptology conference. pp. 75- 89 ,(1997) , 10.1007/BFB0052228
Ivan Damgård, Jesper Buus Nielsen, Improved Non-committing Encryption Schemes Based on a General Complexity Assumption international cryptology conference. pp. 432- 450 ,(2000) , 10.1007/3-540-44598-6_27
Eike Kiltz, Adam O’Neill, Adam Smith, Instantiability of RSA-OAEP under chosen-plaintext attack international cryptology conference. ,vol. 2011, pp. 295- 313 ,(2010) , 10.1007/978-3-642-14623-7_16
Craig Gentry, Zulfikar Ramzan, Single-Database Private Information Retrieval with Constant Communication Rate Automata, Languages and Programming. pp. 803- 815 ,(2005) , 10.1007/11523468_65
Christian Cachin, Silvio Micali, Markus Stadler, None, Computationally private information retrieval with polylogarithmic communication theory and application of cryptographic techniques. pp. 402- 414 ,(1999) , 10.1007/3-540-48910-X_28
Devdatt P. Dubhashi, Alessandro Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms ,(2012)
Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation symposium on the theory of computing. pp. 1- 10 ,(1988) , 10.1145/62212.62213
O. Goldreich, S. Micali, A. Wigderson, How to play ANY mental game symposium on the theory of computing. pp. 218- 229 ,(1987) , 10.1145/28395.28420