Do we need to rethink guidance on repeated interviews?

Within the legal system, children are frequently interviewed about their experiences more than once, with different information elicited in different interviews. The presumed positive and negative effects of multiple interviewing have generated debate and controversy within the legal system and among researchers. Some commentators emphasise that repeated interviews foster inaccurate recall and are inherently suggestive, whereas others emphasise the benefits of allowing witnesses more than one opportunity to recall information. In this article we briefly review the literature on repeated interviewing before presenting a series of cases highlighting what happens when children are interviewed more than once for various reasons. We conclude that, when interviewers follow internationally recognised best-practice guidelines emphasising open-questions and free memory recall, alleged victims of abuse should be interviewed more than once to ensure that more complete accounts are obtained. Implications for current legal guidelines concerning repeated interviewing are discussed

Non-verbal behavior of children who disclose or do not disclose child abuse in investigative interviews

Objective: The study focused on children’s nonverbal behavior in investigative interviews exploring suspicions of child abuse. The key aims were to determine whether non-verbal behavior in the pre-substantive phases of the interview predicted whether or not children would disclose the alleged abuse later in the interview and to identify differences in the nonverbal behaviors of disclosing and non-disclosing children. Method: We studied DVD-recorded interviews of 40 alleged victims of child abuse. In all cases, there was external evidence strongly suggesting that abuse had occurred. However, half of the children disclosed abuse when interviewed using the NICHD Investigative Interview Protocol, whereas the other half did not. Two raters, unaware whether or not the children disclosed, independently coded the videotapes for nonverbal indices of positive and negative emotions, stress, and physical disengagement in each 15-second unit of the introductory, rapport building, and substantive interview phases. Results: Indicators of stress and physical disengagement increased as the interviews progressed while indices of positive emotions decreased. Non-disclosers showed proportionately more physical disengagement than disclosers in both the introductory and substantive phases. Conclusions: Awareness of non-verbal behavior may help investigators identify reluctant children early in forensic interviews. Practice implications: There is substantial evidence that, when questioned by investigators, many children do not disclose that they have been abused. The early detection of reluctance to disclose may allow interviewers to alter their behavior, helping the children overcome their reluctance by providing non-suggestive support before the possibility of abuse is discussed. Of course, nonverbal behavior alone should not be used to assess children in investigative interviews. However, nonverbal cues may nonetheless provide additional information to interviewers and assist them in identifying reluctant children

Round Optimal Black-Box “Commit-and-Prove”

Motivatedbytheoreticalandpracticalconsiderations,anim- portant line of research is to design secure computation protocols that only make black-box use of cryptography. An important component in nearly all the black-box secure computation constructions is a black- box commit-and-prove protocol. A commit-and-prove protocol allows a prover to commit to a value and prove a statement about this value while guaranteeing that the committed value remains hidden. A black- box commit-and-prove protocol implements this functionality while only making black-box use of cryptography. In this paper, we build several tools that enable constructions of round- optimal, black-box commit and prove protocols. In particular, assuming injective one-way functions, we design the first round-optimal, black- box commit-and-prove arguments of knowledge satisfying strong privacy against malicious verifiers, namely: – Zero-knowledge in four rounds and, – Witness indistinguishability in three rounds. Prior to our work, the best known black-box protocols achieving commit- and-prove required more rounds. We additionally ensure that our protocols can be used, if needed, in the delayed-input setting, where the statement to be proven is decided only towards the end of the interaction. We also observe simple applications of our protocols towards achieving black-box four-round constructions of extractable and equivocal commitments. We believe that our protocols will provide a useful tool enabling several new constructions and easy round-efficient conversions from non-black- box to black-box protocols in the future

"lt\u27s much more of a family issue than a legal one". Examining the decision-making process of forensic interviewers in cases of sibling sexual abuse

Sibling sexual abuse (SSA) is defined as a range of childhood sexual behaviors that do not meet the criteria of age-appropriate curiosity. Despite being perhaps the most prevalent and longest-term form of sexual abuse within the family - and widely seen as having the warst impact on those involved - SSA is the most underreported and undertreated. This study is designed to further our knowledge of this understudied phenomenon by delving into the decision-making processes of practitioners treating SSA families. The decision-making process involved in forensic interviews was analysed in 42 cases of SSA. A qualitative thematic analysis addressed the forensic interviewers\u27 assessment of the children and their families and the decisions they made about child referrals for further treatment. The findings highlight the complexity of practitioners\u27 decision-making in SSA cases and the need to enhance practitioners\u27 knowledge and practice with respect to SSA, specifically where considerable lacunas remain: lack of process standardization, and misunderstanding of family and abuse dynamics. lmplications for research, policy, and practice are discussed in the unique cultural context of Israeli society. (DIPF/Orig.

Complete fairness in secure two-party computation

In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness, which guarantees that if either party receives its output, then the other party does too. Cleve (STOC 1986) showed that complete fairness cannot be achieved in general in the two-party setting; specifically, he showed (essentially) that it is impossible to compute Boolean XOR with complete fairness. Since his work, the accepted folklore has been that nothing non-trivial can be computed with complete fairness, and the question of complete fairness in secure two-party computation has been treated as closed since the late ’80s. In this paper, we demonstrate that this widely held folklore belief is false by showing completely-fair secure protocols for various non-trivial two-party functions including Boolean AND/OR as well as Yao’s “millionaires ’ problem”. Surprisingly, we show that it is even possible to construct completely-fair protocols for certain functions containing an “embedded XOR”, although in this case we also prove a lower bound showing that a super-logarithmic number of rounds are necessary. Our results demonstrate that the question of completely-fair secure computation without an honest majority is far from closed

Concurrently-secure blind signatures without random oracles or setup assumptions

Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions and is the first to be proven secure in a concurrent setting (under any assumptions) without random oracles or a common reference string. Along the way, we also introduce new definitions of security for blind signature schemes.