Sciweavers

1646 search results - page 1 / 330
» Automatic generation of two-party computations
Sort
View
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
13 years 10 months ago
A New Two-Party Identity-Based Authenticated Key Agreement
We present a new two-party identity-based key agreement that is more efficient than previously proposed schemes. It is inspired on a new identity-based key pair derivation algorith...
Noel McCullagh, Paulo S. L. M. Barreto
NDSS
2003
IEEE
13 years 10 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the server...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
13 years 10 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
CCS
2011
ACM
12 years 4 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
IACR
2011
196views more  IACR 2011»
12 years 4 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs