Sciweavers

35 search results - page 1 / 7
» On the Efficiency and Security of Pairing-Based Protocols in...
Sort
View
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 2 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
CCS
2008
ACM
13 years 6 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
CSFW
2007
IEEE
13 years 11 months ago
Secure Implementations for Typed Session Abstractions
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
Ricardo Corin, Pierre-Malo Deniélou, C&eacu...
SCN
2008
Springer
13 years 4 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
CCR
1999
110views more  CCR 1999»
13 years 4 months ago
Independent active program representation using ASN. 1
act Syntax Notation One (ASN.1) can be used as a common substrate for representing active programs. An active networking framework, using ASN.1 whereby any active network solution ...
Brad Williamson, Craig Farrell