Sciweavers

40 search results - page 3 / 8
» asiacrypt 2009
Sort
View
ASIACRYPT
2009
Springer
14 years 3 days ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
ASIACRYPT
2009
Springer
14 years 3 days ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung
SCN
2010
Springer
124views Communications» more  SCN 2010»
13 years 3 months ago
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohen...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
ASIACRYPT
2009
Springer
14 years 3 days ago
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
Tibor Jager, Jörg Schwenk
ASIACRYPT
2009
Springer
14 years 3 days ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky