Sciweavers

659 search results - page 76 / 132
» Compiling and securing cryptographic protocols
Sort
View
103
Voted
EUROCRYPT
2007
Springer
15 years 4 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
115
Voted
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
15 years 7 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
89
Voted
CCR
2005
95views more  CCR 2005»
15 years 13 days ago
Efficient security for IPv6 multihoming
In this note, we propose a security mechanism for protecting IPv6 networks from possible abuses caused by the malicious usage of a multihoming protocol. In the presented approach,...
Marcelo Bagnulo, Alberto García-Martí...
134
Voted
CORR
2010
Springer
225views Education» more  CORR 2010»
15 years 4 days ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
109
Voted
ICISC
2007
100views Cryptology» more  ICISC 2007»
15 years 2 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi