Sciweavers

546 search results - page 14 / 110
» On the Power of Secure Two-Party Computation
Sort
View
EUROCRYPT
2009
Springer
15 years 10 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
IACR
2011
120views more  IACR 2011»
13 years 9 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
INFOCOM
2012
IEEE
13 years 2 days ago
Towards temporal access control in cloud computing
—Access control is one of the most important security mechanisms in cloud computing. Attribute-based access control provides a flexible approach that allows data owners to integ...
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Dijiang Huang,...
CCS
2005
ACM
15 years 3 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough