Sciweavers

2967 search results - page 338 / 594
» Cryptology
Sort
View
EUROCRYPT
2007
Springer
15 years 10 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
EUROCRYPT
2007
Springer
15 years 10 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
FC
2007
Springer
105views Cryptology» more  FC 2007»
15 years 10 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
CTRSA
2009
Springer
112views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Divisible On-Line/Off-Line Signatures
On-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing pro...
Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming...
ACNS
2004
Springer
167views Cryptology» more  ACNS 2004»
15 years 10 months ago
A Fully-Functional Group Signature Scheme over Only Known-Order Group
The concept of group signature allows a group member to sign message anonymously on behalf of the group. In the event of a dispute, a designated entity can reveal the identity of a...
Atsuko Miyaji, Kozue Umeda