Sciweavers

773 search results - page 4 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
ICICS
2004
Springer
14 years 3 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
EUROCRYPT
2003
Springer
14 years 2 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
FOCS
2010
IEEE
13 years 7 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
JCS
2006
91views more  JCS 2006»
13 years 9 months ago
A survey of algebraic properties used in cryptographic protocols
Abstract: Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches usually consider the encryption schemes as black boxes and assume that ...
Véronique Cortier, Stéphanie Delaune...
FOCS
2004
IEEE
14 years 1 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...